Related papers: Syzygies among reduction operators
Operations research practitioners frequently want to model complicated functions that are are difficult to encode in their underlying optimisation framework. A common approach is to solve an approximate model, and to use a simulation to…
For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary states of the system and merging redundant states in the…
In this paper we examine various properties/constructions which are known for reductive groups and we do some experiments to see to what extent they generalize to symmetric spaces.
Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…
In the setting of modern mathematical logic and model theory, classification theory has been one of the landmark achievements of the field. Likewise, the classification of UHF-algebras and AF-algebras were substantial contributions to the…
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…
A method for construction of analytic function f of the annihilation operator is given for the first time. f(z) is analytic on some compact domain that does not separate the complex plane. A new form of the identity is given, which is well…
The isomorphism between the reduction algebra and the invariant differential operators on G/H is sketched.
We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…
In commutative algebra, the theory of Gr\"obner bases enables one to compute in any finitely generated algebra over a given computable field. For non-finitely generated algebras however, other methods have to be pursued. For instance, it…
The Composite Operator Method (COM) is formulated, its internals illustrated in detail and some of its most successful applications reported. COM endorses the emergence, in strongly correlated systems (SCS), of composite operators,…
A new totally algebraic formalism based on general, abstract ladder operators has been proposed. This approach heavily grounds in the superoperator formalism of Primas. However it is necessary to introduce many improvements in his…
We show that it is possible to formulate the most general first-class gauge algebra of the operator formalism by only using BRST-invariant constraints. In particular, we extend a previous construction for irreducible gauge algebras to the…
We give an elementary construction of symplectic connections through reduction. This provides an elegant description of a class of symmetric spaces and gives examples of symplectic connections with Ricci type curvature, which are not…
Frames and orthonormal bases are naturally linked to bounded operators. To tackle unbounded operators those sequences might not be well suited. This has already been noted by von Neumann in the 1920ies. But modern frame theory also…
Composition operators with analytic symbols on some reproducing kernel Hilbert spaces of entire functions on a complex Hilbert space are studied. The questions of their boundedness, seminormality and positivity are investigated. It is…
Given a bounded linear operator $T$ on separable Hilbert space, we develop an approach allowing one to construct a matrix representation for $T$ having certain specified algebraic or asymptotic structure. We obtain matrix representations…
Using reduction of spherical functions, we obtain generators of the algebra and the field of invariants for the coadjoint representation of Borel and maximal nilpotent subalgebras of simple Lie algebras.
Within the program of finding axiomatizations for various parts of computability logic, it was proved earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting's intuitionistic calculus. That sort…
In this paper we give a construction for a special type of congruences on commutative semigroups. We apply our result for the multiplicative semigroup of all positive integers.