相关论文: Algebraic structure of aromatic B-series
For quadratic spaces which represent 1 there is a characterization of hermitian compositions in the language of algebras-with-involutions using the even Clifford algebra. We extend this notion to define a generalized composition based on…
We survey structures endowed with natural partial orderings and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism order…
We give a description of the algebraic families of birational transformations of an algebraic variety X. As an application, we show that the morphisms to Bir(X) given by algebraic families satisfy a Chevalley type result and a certain…
We study the structure of a family of algebras which encodes a generalization of the Pieri Rule for the complex orthogonal group. In particular, we show that each of these algebras has a standard monomial basis and has a flat deformation to…
We provide structural criteria for some finite factorised groups $G = AB$ when the conjugacy class sizes in $G$ of certain $\pi$-elements in $A\cup B$ are either $\pi$-numbers or $\pi'$-numbers, for a set of primes $\pi$. In particular, we…
We present a generalization of the notion of an algebra norm relevant to real finite-dimensional unital associative algebras. Among other things, this leads to a novel set of algebra isomorphism invariants, some of which are computationally…
Algebraically constructible functions connect real algebra with the topology of algebraic sets. In this survey we present some history, definitions, properties, and algebraic characterizations of algebraically constructible functions, and a…
We investigate algebraic structures within sets of surjective and injective linear operators between sequence spaces, completing results of Aron et al.
Compositionality proofs in higher-order languages are notoriously involved, and general semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi and Plotkin's bialgebraic abstract GSOS framework, which…
What does it mean for an algebraic rewrite rule to subsume another rule (that may then be called a subrule)? We view subsumptions as rule morphisms such that the simultaneous application of a rule and a subrule (i.e. the application of a…
We consider the numbers arising in the problem of normal ordering of expressions in canonical boson creation and annihilation operators. We treat a general form of a boson string which is shown to be associated with generalizations of…
We introduce the combinatorial notion of posetted trees and we use it in order to write an explicit expression of the Baker-Campbell-Hausdorff formula.
For arbitrary F-algebra, in which the operation of addition is defined, I explore biring of matrices of mappings. The sum of matrices is determined by the sum in F-algebra, and the product of matrices is determined by the product of…
A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…
This paper deals with algorithms for producing and ordering lexical and nonlexical sequences of a given degree. The notion of "elementary operations" on positive integral sequences is introduced. Our main theorem answers the question of…
An elegant description of the general form of order automorphisms of effect algebras has been known in the complex case. We present a much simpler proof based on the projective geometry which works also in the real case. As an application…
We give a homological interpretation of the coefficients of the Hilbert series for an algebra associated with a directed graph and its dual algebra. This allows us to obtain necessary conditions for Koszulity of such algebras in terms of…
We develop a systematic way for constructing bispectral algebras of commuting ordinary differential operators of any rank $N$. It combines and unifies the ideas of Duistermaat-Gr\"unbaum and Wilson. Our construction is completely…
A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…
Some techniques for the use of bitwise operations are described in the article. As an example, an open problem of isomorphism-free generations of combinatorial objects is discussed. An equivalence relation on the set of square binary…