相关论文: Algebraic Combinatorics of Magic Squares

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

Polytope theory has produced a great number of remarkably simple and complete characterization results for face-number sets or f-vector sets of classes of polytopes. We observe that in most cases these sets can be described as the…

We introduce a general class of combinatorial objects, which we call \emph{multi-complexes}, which simultaneously generalizes graphs, multigraphs, hypergraphs and simplicial and delta complexes. We introduce a natural algebra of…

We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…

Explicit algebraic area enumeration formulae are derived for various lattice walks generalizing the canonical square lattice walk, and in particular for the triangular lattice chiral walk recently introduced by the authors. A key element in…

Based on high precision computation of periods and lattice reduction techniques, we compute the Picard group of smooth surfaces. We also study the lattice reduction technique that is employed in order to quantify the possibility of…

Similar to how standard Young tableaux represent paths in the Young lattice, Latin rectangles may be use to enumerate paths in the poset of semi-magic squares with entries zero or one. The symmetries associated to determinant preserve this…

Magic-square constraints define Diophantine systems whose solutions, in several natural families, exhibit rigid periodic structure. We study this structure in an oracle setting, where a marked set of integers is given by black-box access…

We construct explicit polynomial realizations of some combinatorial Hopf algebras based on various kind of trees or forests, and some more general classes of graphs, ranging from the Connes-Kreimer algebra to an algebra of labelled forests…

We study relations between the eigenvectors of rational matrix functions on the Riemann sphere. Our main result is that for a subclass of functions that are products of two elementary blocks it is possible to represent these relations in a…

This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…

Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…

Since the Jones polynomial was discovered, the connection between knot theory and quantum physics has been of great interest. Lomonaco and Kauffman introduced the knot mosaic system to give a definition of the quantum knot system that is…

Weyl group multiple Dirichlet series and metaplectic Whittaker functions can be described in terms of crystal graphs. We present crystals as parameterized by Littelmann patterns and we give a survey of purely combinatorial constructions of…

We use the results of AG/0406290 to discuss the counting formulas of network flow polytopes and magic squares, i.e. the formula for the corresponding Ehrhart polynomial in terms of residues. We also discuss a description of the big cells…

A well-known problem in Algebraic Combinatorics, is the enumeration of circulant graphs. The failure of Adam's Conjecture for such graphs with order containing a repeated prime, led researchers to investigate the problem using two different…

In this paper we give the first method for constructing n-multimagic squares (and hypercubes) for any n. We give an explicit formula in the case of squares and an effective existence proof in the higher dimensional case. Finally we prove…

In this work, we introduce a novel concept of magic billiards, which can be seen as an umbrella, unifying several well-known generalisations of mathematical billiards. We analyse properties of magic billiards in the case of elliptical…

Motivated by a rigidity-theoretic perspective on the Localization Problem in 2D, we develop an algorithm for computing circuit polynomials in the algebraic rigidity matroid associated to the Cayley-Menger ideal for $n$ points in 2D. We…

Zonotopes are a rich and fascinating family of polytopes, with connections to many areas of mathematics. In this article we provide a brief survey of classical and recent results related to lattice zonotopes. Our emphasis is on connections…