Related papers: Combinatorial theory of permutation-invariant rand…

We propose a simple approach to formal deformations of associative algebras. It exploits the machinery of multiplicative coresolutions of an associative algebra A in the category of A-bimodules. Specifically, we show that certain…

We introduce the notion of combinatorial encoding of continuous dynamical systems and suggest the first examples, which are the most interesting and important, namely, the combinatorial encoding of a Bernoulli process with continuous state…

$W$-representation realizes partition functions by an action of a cut-and-join-like operator on the vacuum state with a zero-mode background. We provide explicit formulas of this kind for $\beta$- and $q,t$-deformations of the simplest…

The $\mathcal{A}$-tracial algebras are algebras endowed with multi-linear forms, compatible with the product, and indexed by partitions. Using the notion of $\mathcal{A}$-cumulants, we define and study the $\mathcal{A}$-freeness property…

This article investigates atomic decompositions in geometric lattices isomorphic to the partition lattice $\Pi(X)$ of a finite set $X$, a fundamental structure in lattice theory and combinatorics. We explore the role of atomicity in these…

The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…

Probabilistic graphical models are a key tool in machine learning applications. Computing the partition function, i.e., normalizing constant, is a fundamental task of statistical inference but it is generally computationally intractable,…

This work explores the deformation theory of algebraic structures in a very general setting. These structures include commutative, associative algebras, Lie algebras, and the infinity versions of these structures, the strongly homotopy…

The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher's theorem: for all $m \geq 2$ and…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…

We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…

Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optimization algorithms may enable efficient point estimation,…

In this thesis we will study matrix models with discrete gauge group $S_N$. We will put these matrix models into a generalized Schur-Weyl duality framework where dual algebras, known as partition algebras, emerge. These form generalizations…

We describe the implications of permutation symmetry for the state space and dynamics of quantum mechanical systems of matrices of general size $N$. We solve the general 11- parameter permutation invariant quantum matrix harmonic oscillator…

This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…

We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…

In this thesis manuscript we explore different facets of random tensor models. These models have been introduced to mimic the incredible successes of random matrix models in physics, mathematics and combinatorics. After giving a very short…

We study partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. These permutations are the linear…

We give a definition of partition C*-algebras: To any partition of a finite set, we assign algebraic relations for a matrix of generators of a universal C*-algebra. We then prove how certain relations may be deduced from others and we…