Related papers: Costas cubes
We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the…
Double cosets appear in many contexts in combinatorics, for example in the enumeration of certain objects up to symmetries. Double cosets in a quotient of the form $H\backslash G / H$ have an inverse, and can be their own inverse. In this…
A PSCA$(v, t, \lambda)$ is a multiset of permutations of the $v$-element alphabet $\{0, \dots, v-1\}$ such that every sequence of $t$ distinct elements of the alphabet appears in the specified order in exactly $\lambda$ permutations. For $v…
Uniform measures have played a fundamental role in geometric measure theory since they naturally appear as tangent objects. For instance, they were essential in the groundbreaking work of Preiss on the rectifiability of Radon measures.…
Skew-symmetric sum of $N!$ compositions of $N$ vector fields in all possible order is called $N$-commutator. We construct 10-commutator and 13-commutator on a space of vector fields $Vect(3)$ and 10-commutator on a space of divergenceless…
The classic method for mass determination in a SUSY-like cascade decay chain relies on measurements of the kinematic endpoints in the invariant mass distributions of suitable collections of visible decay products. However, the procedure is…
We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.
The existence of large sets of Kirkman triple systems (LKTSs) is one of the best-known open problems in combinatorial design theory. Steiner quadruple systems with resolvable derived designs (RDSQSs) play an important role in the recursive…
An ordered triple $(s,p,n)$ is called admissible if there exist two different multisets $X=\{x_1,x_2,\dotsc,x_n\}$ and $Y=\{y_1,y_2,\dotsc,y_n\}$ such that $X$ and $Y$ share the same sum $s$, the same product $p$, and the same size $n$. We…
We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…
In this article we investigate the existence of (2,3)-cordial labelings of oriented hypercubes. In this investigation, we determine that there exists a (2,3)-cordial oriented hypercube for any dimension divisible by 3. Next, we provide…
A binary linear code whose permutation automorphism group has a fixed point free permutation of order $3$ is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let $C$ be a…
We show that the symmetry groups of the cut cone Cut(n) and the metric cone Met(n) both consist of the isometries induced by the permutations on {1,...,n}; that is, Is(Cut(n))=Is(Met(n))=Sym(n) for n>4. For n=4 we have…
This paper discusses the permutations that are generated by rotating $k \times k$ blocks of squares in a union of overlapping $k \times (k+1)$ rectangles. It is found that the single-rotation parity constraints effectively determine the…
In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended…
We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes \cite{SM},…
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…
We introduce constrained polynomial zonotopes, a novel non-convex set representation that is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection, union, and quadratic as well as higher-order maps. We show…
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…
Every Latin square has three attributes that can be even or odd, but any two of these attributes determines the third. Hence the parity of a Latin square has an information content of 2 bits. We extend the definition of parity from Latin…