12,736 research outputs found
The beat of a fuzzy drum: fuzzy Bessel functions for the disc
The fuzzy disc is a matrix approximation of the functions on a disc which
preserves rotational symmetry. In this paper we introduce a basis for the
algebra of functions on the fuzzy disc in terms of the eigenfunctions of a
properly defined fuzzy Laplacian. In the commutative limit they tend to the
eigenfunctions of the ordinary Laplacian on the disc, i.e. Bessel functions of
the first kind, thus deserving the name of fuzzy Bessel functions.Comment: 30 pages, 8 figure
An Abstract Approach to Consequence Relations
We generalise the Blok-J\'onsson account of structural consequence relations,
later developed by Galatos, Tsinakis and other authors, in such a way as to
naturally accommodate multiset consequence. While Blok and J\'onsson admit, in
place of sheer formulas, a wider range of syntactic units to be manipulated in
deductions (including sequents or equations), these objects are invariably
aggregated via set-theoretical union. Our approach is more general in that
non-idempotent forms of premiss and conclusion aggregation, including multiset
sum and fuzzy set union, are considered. In their abstract form, thus,
deductive relations are defined as additional compatible preorderings over
certain partially ordered monoids. We investigate these relations using
categorical methods, and provide analogues of the main results obtained in the
general theory of consequence relations. Then we focus on the driving example
of multiset deductive relations, providing variations of the methods of matrix
semantics and Hilbert systems in Abstract Algebraic Logic
Graph ambiguity
In this paper, we propose a rigorous way to define the concept of ambiguity in the domain of graphs. In past studies, the classical definition of ambiguity has been derived starting from fuzzy set and fuzzy information theories. Our aim is to show that also in the domain of the graphs it is possible to derive a formulation able to capture the same semantic and mathematical concept. To strengthen the theoretical results, we discuss the application of the graph ambiguity concept to the graph classification setting, conceiving a new kind of inexact graph matching procedure. The results prove that the graph ambiguity concept is a characterizing and discriminative property of graphs. (C) 2013 Elsevier B.V. All rights reserved
Gauge and Poincare' Invariant Regularization and Hopf Symmetries
We consider the regularization of a gauge quantum field theory following a
modification of the Polchinski proof based on the introduction of a cutoff
function. We work with a Poincare' invariant deformation of the ordinary
point-wise product of fields introduced by Ardalan, Arfaei, Ghasemkhani and
Sadooghi, and show that it yields, through a limiting procedure of the cutoff
functions, to a regularized theory, preserving all symmetries at every stage.
The new gauge symmetry yields a new Hopf algebra with deformed co-structures,
which is inequivalent to the standard one.Comment: Revised version. 14 pages. Incorrect statements eliminate
- …