English
Related papers

Related papers: Steiner triple systems without parallel classes

200 papers

It is shown that there are exactly seventy-eight 3-generator 2- groups of order 2^11 with trivial Schur multiplier. We then give 3-generator, 3-relation presentations for forty-eight of them proving that these groups have deficiency zero.

Group Theory · Mathematics 2011-11-18 Shirin Fouladi , Reza Orfi

In this paper we prove that there are finitely many modular curves that admit a smooth plane model. Moreover, if the degree of the model is greater than or equal to 19, no such curve exists. For modular curves of Shimura type we show that…

Number Theory · Mathematics 2022-09-26 Samuele Anni , Eran Assaf , Elisa Lorenzo García

We address several extremal problems concerning the spreading property of point sets of Steiner triple systems. This property is closely related to the structure of subsystems, as a set is spreading if and only if there is no proper…

Combinatorics · Mathematics 2021-03-02 Zoltán Lóránt Nagy , Levente Szemerédi

The simple symplectic triple systems over the real numbers are classified up to isomorphism, and linear models of all of them are provided. Besides the split cases, one for each complex simple Lie algebra, there are two kinds of non-split…

Rings and Algebras · Mathematics 2022-05-16 Cristina Draper , Alberto Elduque

The Terwilliger algebras of asymmetric association schemes of rank $3$, whose nonidentity relations correspond to doubly regular tournaments, are shown to have thin irreducible modules, and to always be of dimension $4k+9$ for some positive…

Combinatorics · Mathematics 2024-04-18 Allen Herman

A set grading on the split simple Lie algebra of type $D_{13}$, that cannot be realized as a group-grading, is constructed by splitting the set of positive roots into a disjoint union of pairs of orthogonal roots, following a pattern…

Rings and Algebras · Mathematics 2022-05-16 Alberto Elduque

A recent article of Berndt and Yee found congruences modulo 3^k for certain ratios of Eisenstein series. For all but one of these, we show there are no simple congruences a(pn+c) = 0 modulo p when p>= 13 is prime. This follows from a more…

Number Theory · Mathematics 2009-10-02 Michael Dewar

In this paper we construct explicit smooth solutions to the Strominger system on generalized Calabi-Gray manifolds, which are compact non-K\"ahler Calabi-Yau 3-folds with infinitely many distinct topological types and sets of Hodge numbers.

Differential Geometry · Mathematics 2021-01-12 Teng Fei , Zhijie Huang , Sebastien Picard

We construct infinitely many connected, circulant digraphs of outdegree three that have no hamiltonian circuit. All of our examples have an even number of vertices, and our examples are of two types: either every vertex in the digraph is…

Combinatorics · Mathematics 2013-06-25 Stephen C. Locke , Dave Witte Morris

We consider the avoidance of patterns in inversion sequences that relate sorting via sorting machines including data structures such as pop stacks and stacks. Such machines have been studied under a variety of additional constraints and…

Combinatorics · Mathematics 2025-02-12 Toufik Mansour , Howard Skogman , Rebecca Smith

Using depth of coherent sheaves on noetherian algebraic stacks, we construct non-Azumaya maximal orders in unramified central simple algebras over schemes of dimension at least $3$.

Algebraic Geometry · Mathematics 2014-12-09 Benjamin Antieau , Kenneth Chan

An $r$-block-coloring, simply $r$-coloring, of a Steiner triple system $\mathrm{STS}(v)$ is a partition of the block set into $r$ color classes, each color class being a partial parallel class. The chromatic index of $\mathrm{STS}(v)$,…

Combinatorics · Mathematics 2025-03-18 Yuli Tan , Junling Zhou

Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…

Combinatorics · Mathematics 2010-03-10 Michael Huber

We introduce near triple arrays as binary row-column designs with at most two consecutive values for the replication numbers of symbols, for the intersection sizes of pairs of rows, pairs of columns and pairs of a row and a column. Near…

Combinatorics · Mathematics 2025-03-11 Alexey Gordeev , Klas Markström , Lars-Daniel Öhman

In the paper we study the structure of hyperplanes of so called binomial partial Steiner triple systems (BSTS's, in short) i.e. of configurations with $\binom{n}{2}$ points and $\binom{n}{3}$ lines, each line of the size $3$. Consequently,…

Combinatorics · Mathematics 2015-08-26 Krzysztof Petelczyc , Małgorzata Prażmowska , Krzysztof Prażmowski

We construct new symmetric Hadamard matrices of orders $92,116$, and $172$. While the existence of those of order $92$ was known since 1978, the orders $116$ and $172$ are new. Our construction is based on a recent new combinatorial array…

Combinatorics · Mathematics 2017-09-06 Olivia Di Matteo , Dragomir Z. Djokovic , Ilias S. Kotsireas

We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with any irrational angle in degree: they are three $1$-parameter families of pentagonal subdivisions of the Platonic solids, with…

Combinatorics · Mathematics 2024-12-12 Junjie Shu , Yixi Liao , Erxiao Wang

We construct the smooth, compact moduli space of similarity classes of labeled, oriented triangles. The space, denoted $\mathfrak D$, is a connected sum of three projective planes, and projects via blowdown to two shape spaces that have…

Algebraic Geometry · Mathematics 2025-08-01 Eric Brussel , Madeleine Goertz , Elijah Guptill , Kelly Lyle

A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…

Computational Complexity · Computer Science 2025-10-07 Erin Chambers , Tim Ophelders , Anna Schenfisch , Julia Sollberger

We propose a new approach to studies on partial Steiner triple systems consisting in determining complete graphs contained in them. We establish the structure which complete graphs yield in a minimal PSTS that contains them. As a by-product…

Combinatorics · Mathematics 2014-10-30 M. Prażmowska , K. Prażmowski