Related papers: Enumerating Steiner Triple Systems
The existence of Large sets of Kirkman Triple Systems (LKTS) is an old problem in combinatorics. Known results are very limited, and a lot of them are based on the works of Denniston \cite{MR0349416, MR0369086, MR535159, MR539718}. The only…
We explicitly compute the lower algebraic K-theory of the split three-dimensional crystallographic groups; i.e., the groups G that act properly and cocompactly on three-dimensional Euclidean space by isometries, such that the natural map…
Recently, it was realized that quantum states of matter can be classified as long-range entangled (LRE) states (i.e. with non-trivial topological order) and short-range entangled (SRE) states (\ie with trivial topological order). We can use…
We classify all cubic systems possessing the maximum number of invariant straight lines (real or complex) taking into account their multiplicities. We prove that there are exactly 23 topological different classes of such systems. For every…
A rack on $[n]$ can be thought of as a set of maps $(f_x)_{x \in [n]}$, where each $f_x$ is a permutation of $[n]$ such that $f_{(x)f_y} = f_y^{-1}f_xf_y$ for all $x$ and $y$. In 2013, Blackburn showed that the number of isomorphism classes…
Techniques of producing new combinatorial structures from old ones are commonly called trades. The switching principle applies for a broad class of designs: it is a local transformation that modifies two columns of the incidence matrix. In…
An ordered partition of [n]:={1,2,..., n} is a sequence of its disjoint subsets whose union is [n]. The number of ordered partitions of [n] with k blocks is k!S(n,k), where S(n,k) is the Stirling number of second kind. In this paper we…
The problem of classifying the convex pentagons that admit tilings of the plane is a long-standing unsolved problem. Previous to this article, there were 14 known distinct kinds of convex pentagons that admit tilings of the plane. Five of…
The Steiner tree problem can be stated in terms of finding a connected set of minimal length containing a given set of finitely many points. We show how to formulate it as a mass-minimization problem for $1$-dimensional currents with…
In the tensor completion problem, one seeks to estimate a low-rank tensor based on a random sample of revealed entries. In terms of the required sample size, earlier work revealed a large gap between estimation with unbounded computational…
In this work, we introduce a new type of topological order which is protected by subsystem symmetries which act on lower dimensional subsets of lattice many-body system, e.g. along lines or planes in a three dimensional system. The symmetry…
A $\textit{covering system}$ is a collection of integer congruences such that every integer satisfies at least one congruence in the collection. A covering system is called $\textit{distinct}$ if all of its moduli are distinct. An expansive…
We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…
We investigate which invariants of groups are powerful in distinguishing non-isomorphic p-groups. We introduce the notations of siblings and twins for p-groups that are difficult to distinguish and we describe the siblings and twins among…
Model checking has been proposed as a formal verification approach for analyzing computer-based and cyber-physical systems. The state space explosion problem is the main obstacle for applying this approach for sophisticated systems.…
All binary self-dual [44,22,8] codes with an automorphism of order 3 or 7 are classified. In this way we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order.
Topological phases of matter is a natural place for encoding robust qubits for quantum computation. In this work we extend the newly introduced class of qubits based on valence-bond solid models with SPT (symmetry-protected topological)…
We investigate the bi-orderability of two-bridge knot groups and the groups of knots with 12 or fewer crossings by applying recent theorems of Chiswell, Glass and Wilson. Amongst all knots with 12 or fewer crossings (of which there are…
Given a seven-element set $X = \{1,2,3,4,5,6,7\}$, there are 30 ways to define a Fano plane on it. Let us call a line of such Fano plane, that is to say an unordered triple from $X$, ordinary or defective according as the sum of two smaller…
There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already…