Related papers: Algebraic Combinatorics of Magic Squares
We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…
We consider various properties and manifestations of some sign-alternating univariate polynomials borne of right-triangular integer arrays related to certain generalizations of the Fibonacci sequence. Using a theory of the root geometry of…
A method for computing integrals of polynomial functions on compact symmetric spaces is given. Those integrals are expressed as sums of functions on symmetric groups.
The main purpose and motivation of this article is to create a linear transformation on the polynomial ring of rational numbers. A matrix representation of this linear transformation based on standard fundamentals will be given. For some…
The n'th Birkhoff polytope is the set of all doubly stochastic n-by-n matrices, that is, those matrices with nonnegative real coefficients in which every row and column sums to one. A wide open problem concerns the volumes of these…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…
We construct Hopf algebras whose elements are representations of combinatorial automorphism groups, by generalising a theorem of Zelevinsky on Hopf algebras of representations of wreath products. As an application we attach symmetric…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
Analogous to the sl(n) case, we address the computation of the index of seaweed subalgebras of sp(2n) by introducing graphical representations called symplectic meanders. Formulas for the algebra's index may be computed by counting the…
Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. G. Higman and others, we give an explicit…
The Jack symmetric polynomials $P_\lambda^{(\alpha)}$ form a class of symmetric polynomials which are indexed by a partition $\lambda$ and depend rationally on a parameter $\alpha$. They reduced to the Schur polynomials when $\alpha=1$, and…
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…
Freudenthal's Magic Square, which in characteristic 0 contains the exceptional Lie algebras other than G2, is extended over fields of characteristic 3, through the use of symmetric composition superalgebras, to a larger square that contains…
Quantum gauge theory in the connection representation uses functions of holonomies as configuration observables. Physical observables (gauge and diffeomorphism invariant) are represented in the Hilbert space of physical states; physical…
We use the characteristic polynomial of the Coxeter matrix of an algebra to complete the combinatorial classification of piecewise hereditary algebras which Happel gave in terms of the trace of the Coxeter matrix. We also give a…
The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining…