Related papers: Enumeration of Row-Column Designs

We present a way of computing Kronecker coefficients that uses a new family of rational convex polytopes, called column-row polytopes. We give several different formulas for the computation. They are alternating sums of numbers of integer…

In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelations. The problem is formulated as a so-called feasibility problem having…

We construct k-parameter families of rational surface automorphisms for any k. These are automorphisms of surfaces X, which are constructed from iterated blowups over the projective plane. In certain cases: we are able to determine the…

We study rigidity properties of linearly ordered sets (chains) under automorphisms, order-embeddings, epimorphisms, and endomorphisms. We focus on two main cases, dense subchains of the real numbers, and uncountable dense chains of higher…

In this article we will describe an algorithm to constructively enumerate non-isomorphic Union closed Sets and Moore sets. We confirm the number of isomorphism classes of Union closed Sets and Moore sets on n<=6 elements presented by other…

In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group $G$. When $G$ is cyclic, these types of matrices have been widely used to build uniform 2-factorizations of small Cayley graphs (or, Cayley…

Column closed pattern subgroups $U$ of the finite upper unitriangular groups $U_n(q)$ are defined as sets of matrices in $U_n(q)$ having zeros in a prescribed set of columns besides the diagonal ones. We explain Jedlitschky's construction…

When formalizing mathematics in (generalized predicative) constructive type theories, or more practically in proof assistants such as Coq or Agda, one is often using setoids (types with explicit equivalence relations). In this note we…

This paper investigates the enumeration of Cayley digraphs, focusing on counting Cayley digraphs on dihedral groups up to CI-isomorphism. By leveraging the Cauchy-Frobenius Lemma and properties of automorphisms, we derive an explicit…

Racks and quandles are prominent set-theoretical solutions of the Yang-Baxter equation. We enumerate racks and quandles of orders $n\le 13$ up to isomorphism, improving upon the previously known results for $n\le 8$ and $n\le 9$,…

It has been recently shown that numerical semiparametric bounds on the expected payoff of fi- nancial or actuarial instruments can be computed using semidefinite programming. However, this approach has practical limitations. Here we use…

The group of 2-by-2 matrices with integer entries and determinant $\pm > 1$ can be identified either with the group of outer automorphisms of a rank two free group or with the group of isotopy classes of homeomorphisms of a 2-dimensional…

We classify the automorphic representations (over number fields) and the irreducible admissible representations (over local fields) of unitary groups which are not quasi-split, under the assumption that the same is known for quasi-split…

Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common subtrees are factored and shared, keeping only one copy of…

In this paper, we study arbitrary (not necessarily associative) 3-dimensional algebras. Such an algebra A is determined by a basis and the corresponding multiplication table, which is specified by 27 structure constants. We describe all…

We introduce consecutive equi-$n$-squares, a variant of equi-$n$-squares in which at least one row or column forms a fixed permutation of $\{1,\dots,n\}$, taken for concreteness to be $(1,\dots,n)$. More generally, the enumeration and…

We consider multidimensional arrays with at most 27 entries over the field with two elements, and their equivalence classes for the action of the direct product of general linear groups. The possible 3-dimensional formats are p x 2 x 2 (p =…

In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…

We establish a fundamental theorem of orders (FTO) which allows us to express all orders uniquely as an intersection of `irreducible orders' along which the index and the conductor distributes multiplicatively. We define a subclass of…

We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…