Related papers: Algebraic Combinatorics of Magic Squares
We present a change of basis that may allow more efficient calculation of the volumes of Birkhoff polytopes using a slicing method. We construct the basis from a special set of square matrices. We explain how to construct this basis easily…
We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…
We explain connections among several, a priori unrelated, areas of mathematics: combinatorics, algebraic statistics, topology and enumerative algebraic geometry. Our focus is on discrete invariants, strongly related to the theory of…
We apply the method of orbit harmonics to the set of break divisors and orientable divisors on graphs to obtain the central and external zonotopal algebras respectively. We then relate a construction of Efimov in the context of…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
This is an introduction to algebraic combinatorics, written for a quarter-long graduate course. It starts with a rigorous introduction to formal power series with some combinatorial applications, then discusses integer partitions (proving…
From the standard procedure for constructing Feynman vacuum graphs in $\phi^4$ theory from the generating functional $Z$, we find a relation with sets of certain combinatorial matrices, which allows us to generate the set of all Feynman…
We give a coalgebra structure on 1-vertex irreducible graphs which is that of a cocommutative coassociative graded connected coalgebra. We generalize the coproduct to the algebraic representation of graphs so as to express a bare 1-particle…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
A multidimensional nonnegative matrix is called polystochastic if the sum of entries in each of its lines equals $1$. The set of all polystochastic matrices of order $n$ and dimension $d$ is a convex polytope $\Omega_n^d$ known as the…
Bi-partite ribbon graphs arise in organising the large $N$ expansion of correlators in random matrix models and in the enumeration of observables in random tensor models. There is an algebra $\mathcal{K}(n)$, with basis given by bi-partite…
We give some formulas of the James-Hopf maps by using combinatorial methods. An application is to give a product decomposition of the spaces $\Omega\Sigma^2(X)$.
In this paper we present a Maple library (MOPs) for computing Jack, Hermite, Laguerre, and Jacobi multivariate polynomials, as well as eigenvalue statistics for the Hermite, Laguerre, and Jacobi ensembles of Random Matrix theory. We also…
First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…
As shown by McMullen in 1983, the coefficients of the Ehrhart polynomial of a lattice polytope can be written as a weighted sum of facial volumes. The weights in such a local formula depend only on the outer normal cones of faces, but are…
The modern algebra concepts are used to construct tables of algebraic spinors related to Clifford algebra multivectors with real and complex coefficients. The following data computed by Mathematica are presented in form of tables for…
This paper announces results on the behavior of some important algebraic and topological invariants --- Euler characteristic, arithmetic genus, and their intersection homology analogues; the signature, etc. --- and their associated…
In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In…
In this article we define an algebraic vertex of a generalized polyhedron and show that it is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope $P$ is a linear…
We survey the combinatorics of the Adinkra, a graphical device for solving differential equations in supersymmetry. These graphs represent an exceptional class of 1-factorizations with further augmentations. As a new feature, we…