Related papers: Latin Polytopes
In this paper, we explain how the classical Catalan families of objects involving paths, tableaux, triangulations, parentheses configurations and more generalize canonically to a three-dimensional version. In particular, we present…
Regarding neighbor balance, we consider natural generalizations of $D$-complete Latin squares and Vatican squares from the finite to the infinite. We show that if $G$ is an infinite abelian group with $|G|$-many square elements, then it is…
In this paper, constructions of multimagic squares are investigated. Diagonal Latin squares and Kronecker products are used to get some constructions of multimagic squares. Consequently, some new families of compound multimagic squares are…
Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…
A latin square of order $n$ with pairwise disjoint subsquares of orders $h_1,\dots,h_k$ such that $h_1+\dots+h_k = n$ is known as a realization. The existence of realizations is a partially solved problem with a few general results for an…
We introduce a large family of combinatorial objects, called standard puzzles, defined by very simple rules. We focus on the standard puzzles for which the enumeration problems can be solved by explicit formulas or by classical numbers,…
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…
A $k$-plane of a $d$-dimensional array is a subarray formed by fixing $d-k$ coordinates and allowing the remaining $k$ coordinates to vary freely. A Latin hypercube of dimension $d$ and order $n$ is an $n\times n\times\cdots\times n$ array…
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…
This paper will present some intuitive interpretation of the parastrophe transformations of arbitrary Latin square. With this trick, we can generate the parastrophes of arbitrary Latin square directly from the original one without…
We study a generalization of the classical correspondence between homogeneous quadratic polynomials, quadratic forms, and symmetric/alternating bilinear forms to forms in $n$ variables. The main tool is combinatorial polarization, and the…
In classical geometry, a linear space is a space that is closed under linear combinations. In tropical geometry, it has long been a consensus that tropical varieties defined by valuated matroids are the tropical analogue of linear spaces.…
Sequential Latin hypercube designs have recently received great attention for computer experiments. Much of the work has been restricted to invariant spaces. The related systematic construction methods are inflexible while algorithmic…
Spherical $t$-designs are finite point sets on the unit sphere that enable exact integration of polynomials of degree at most $t$ via equal-weight quadrature. This concept has recently been extended to spherical $t$-design curves by the use…
An association scheme is called amorphic if every possible fusion of relations gives rise to another association scheme. In earlier work, we showed that if an association scheme has at most one relation that is neither strongly regular of…
An autotopism of a Latin square is a triple $(\alpha,\beta,\gamma)$ of permutations such that the Latin square is mapped to itself by permuting its rows by $\alpha$, columns by $\beta$, and symbols by $\gamma$. Let $\mathrm{Atp}(n)$ be the…
In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…
Polypols are natural generalizations of polytopes, with boundaries given by nonlinear algebraic hypersurfaces. We describe polypols in the plane and in 3-space that admit a unique adjoint hypersurface and study them from an…