Related papers: On the arithmetic product of combinatorial species
We provide a unified framework for the treatment of special integrable systems which we propose to call "generalized mean field systems". Thereby previous results on integrable classical and quantum systems are generalized. Following…
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…
We introduce the notion of a crossed product of an algebra by a coalgebra $C$, which generalises the notion of a crossed product by a bialgebra well-studied in the theory of Hopf algebras. The result of such a crossed product is an algebra…
We introduce the notion of additive units, or `addits', of a pointed Arveson system, and demonstrate their usefulness through several applications. By a pointed Arveson system we mean a spatial Arveson system with a fixed normalised…
There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the search to understand how to extend these natural correspondences,…
We present a unified algebraic framework utilizing the formal Bell transform to bridge the Dirichlet convolution of arithmetic functions with the combinatorial structure of infinite Euler-type products. By analyzing the logarithmic…
We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…
Plural (or multiple-conclusion) cuts are inferences made by applying a structural rule introduced by Gentzen for his sequent formulation of classical logic. As singular (single-conclusion) cuts yield trees, which underlie ordinary natural…
This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…
In this paper I present a conjecture for a recursive algorithm that finds each permutation of combining two sets of objects (AKA the Shuffle Product). This algorithm provides an efficient way to navigate this problem, as each atomic…
A valuation theoretic approach is presented that directly leads to division algebras that are noncrossed products (instead of, e.g., describing Brauer classes of noncrossed products in an abstract manner). While this feature is shared by…
Modular operads relevant to string theory can be equipped with an additional structure, coming from the connected sum of surfaces. Motivated by this example, we introduce a notion of connected sum for general modular operads. We show that a…
In this article the infinite product of bicomplex numbers is defined and the convergence and divergence of this product are discussed.
We introduce the notion of multiplication kernels of birational and $D$-module type and give various examples. We also introduce the notion of a semi-classical multiplication kernel associated with an integrable system and discuss its…
In [Dugan-Glennon-Gunnells-Steingrimsson-2019], the authors introduce tiered trees to define combinatorial objects counting absolutely indecomposable representations of certain quivers, and torus orbits on certain homogeneous varieties. In…
Consider a smooth affine algebraic variety $X$ over an algebraically closed field, and let a finite group $G$ act on it. We assume that the characteristic of the field is greater than the dimension of $X$ and the order of $G$. An explicit…
We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…
The combinatorial theory of species developed by Joyal provides a foundation for enumerative combinatorics of objects constructed from finite sets. In this paper we develop an analogous theory for the enumerative combinatorics of objects…