相关论文: Symmetric Boolean Algebras
The normal form for a system of ode's is constructed from its polynomial symmetries of the linear part of the system, which is assumed to be semi-simple. The symmetries are shown to have a simple structure such as invariant function times…
Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…
We introduce an object that has obvious similarity to the classical one - the algebra of supersymmetric polynomials. Despite the similarity, the known structure theorems on supersymmetric polynomials do not help in the study of the new…
We give a self-contained exposition of some mathematical aspects of the Mueller-Stokes formalism. In the first part we review some basic notions of linear algebra and establish a proper notation. In the second part we introduce the…
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus…
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…
We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…
A metric algebra is a metric variant of the notion of $\Sigma$-algebra, first introduced in universal algebra to deal with algebras equipped with metric structures such as normed vector spaces. In this paper, we showed metric versions of…
Quantum algebras are a mathematical tool which provides us with a class of symmetries wider than that of Lie algebras, which are contained in the former as a special case. After a self-contained introduction to the necessary mathematical…
Poisson algebra is usually defined to be a commutative algebra together with a Lie bracket, and these operations are required to satisfy the Leibniz rule. We describe Poisson structures in terms of a single bilinear operation. This enables…
We explain why numbers occurring in the classification of polygon spaces coincide with numbers of self-dual equivalence classes of threshold functions, or of regular Boolean functions, or of decisive weighted majority games.
This paper introduces a SAT-based technique that calculates a compact and complete symmetry-break for finite model finding, with the focus on structures with a single binary operation (magmas). Classes of algebraic structures are typically…
This work adapts the equivalent definitions of division algebras over a field into multiple types of division algebras in a monoidal category. Examples and consequences of these definitions are then established in various monoidal settings.
A broad class of informationally complete symmetric measurements is introduced. It can be understood as a common generalization of symmetric, informationally complete POVMs and mutually unbiased bases. Additionally, it provides a natural…
We consider a class of linear ODEs of second order with variable coefficients and construct its Lie algebra of Lie group of equivalence transformations. Further we find invariants and differential invariants of this Lie algebra and by using…
It is well known that over an infinite field the ring of symmetric functions in a finite number of variables is isomorphic to the one of polynomial functions on matrices that are invariants by the action of conjugation by general linear…
We discuss new problems in universal algebraic geometry and explain them by boolean equations.
A symmetric pseudo-Boolean function is a map from Boolean tuples to real numbers which is invariant under input variable interchange. We prove that any such function can be equivalently expressed as a power series or factorized. The kernel…
This is a short overview of some recent tendencies in the theory of linear inequalities that are evoked by Boolean valued analysis.
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…