English
Related papers

Related papers: Countable homogeneous Steiner triple systems avoid…

200 papers

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

Logic · Mathematics 2018-05-14 Samuel Braunfeld

Recently, it was shown that a rich class of second-order (maximally) superintegrable systems has an underpinning Hesse-Frobenius structure, i.e.\ a Frobenius structure that is compatible with a Hessian structure such that the Hessian…

Mathematical Physics · Physics 2026-05-12 Andreas Vollmer

We study pushdown systems where control states, stack alphabet, and transition relation, instead of being finite, are first-order definable in a fixed countably-infinite structure. We show that the reachability analysis can be addressed…

Formal Languages and Automata Theory · Computer Science 2015-07-20 Lorenzo Clemente , Sławomir Lasota

A Steiner structure $\dS = \dS_q[t,k,n]$ is a set of $k$-dimensional subspaces of $\F_q^n$ such that each $t$-dimensional subspace of $\F_q^n$ is contained in exactly one subspace of $\dS$. Steiner structures are the $q$-analogs of Steiner…

Combinatorics · Mathematics 2012-11-13 Tuvi Etzion , Alexander Vardy

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

Logic · Mathematics 2021-02-18 Filippo Calderoni , Heike Mildenberger , Luca Motto Ros

Furstenberg--Zimmer structure theory refers to the extension of the dichotomy between the compact and weakly mixing parts of a measure preserving dynamical system and the algebraic and geometric descriptions of such parts to a conditional…

Dynamical Systems · Mathematics 2025-09-30 Asgar Jamneshan

The paper is devoted to the study of free objects in the variety of Steiner loops and of the combinatorial structures behind them, focusing on their automorphism groups. We prove that all automorphisms are tame and the automorphism group is…

Group Theory · Mathematics 2015-05-07 A. Grishkov , D. Rasskazova , M. Rasskazova , I. Stuhl

Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of…

Logic in Computer Science · Computer Science 2015-07-01 Stefan Wöhrle , Wolfgang Thomas

We study cofinal systems of finite subsets of $\omega_1$. We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: in an NIP theory,…

Logic · Mathematics 2024-11-20 Martin Bays , Omer Ben-Neria , Itay Kaplan , Pierre Simon

Nested Steiner quadruple systems are designs derived from Steiner quadruple systems (SQSs) by partitioning each block into pairs. A nested SQS is completely uniform if every possible pair appears with equal multiplicity, and completely…

Combinatorics · Mathematics 2026-01-27 Xiao-Nan Lu

We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile assembly systems in which shapes and patterns that represent…

Computational Complexity · Computer Science 2009-06-19 Matthew J. Patitz , Scott M. Summers

We introduce a uniform method of proof for the following results. For {\em each} of the following conditions, there are $2^{\aleph_0}$ families of Steiner systems, satisfying that condition: i) Theorem~2.2.4: (extending \cite{Chicoetal})…

Combinatorics · Mathematics 2022-01-28 John T. Baldwin

In this article, we further develop the thermodynamic formalism of affine iterated function systems with countably many transformations by showing the existence and extending earlier characterisations of the equilibrium states of finite…

Dynamical Systems · Mathematics 2025-01-22 Antti Käenmäki , Ian D. Morris

In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…

Logic · Mathematics 2011-02-11 Alex Primavesi , Katherine Thompson

The method of obtaining the set of noncanonical hypercomplex number systems by conversion of infinite hypercomplex number system to finite hypercomplex number system depending on multiplication rules and factorization method is described.…

Numerical Analysis · Computer Science 2014-01-14 Yakiv O. Kalinovsky , Dmitry V. Lande , Yuliya E. Boyarinova , Iana V. Khitsko

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…

Combinatorics · Mathematics 2020-05-05 Dávid Mezőfi , Gábor P. Nagy

We construct a Ramsey class whose objects are Steiner systems. In contrast to the situation with general $r$-uniform hypergraphs, it turns out that simply putting linear orders on their sets of vertices is not enough for this purpose: one…

Combinatorics · Mathematics 2017-09-25 Vindya Bhat , Jaroslav Nešetřil , Christian Reiher , Vojtěch Rödl

For $v\equiv 1$ or 3 (mod 6), maximum partial triple systems on $v$ points are Steiner triple systems, STS($v$)s. The 80 non-isomorphic STS(15)s were first enumerated around 100 years ago, but the next case for Steiner triple systems was…

Combinatorics · Mathematics 2017-10-27 Fatih Demirkale , Diane Donovan , Mike Grannell

In our previous papers we introduced categorical invariants, which are, roughly speaking, sets of triangulated subcategories in a given triangulated category and their quotients. Here is extended the list of examples, where these sets are…

Category Theory · Mathematics 2019-07-31 George Dimitrov , Ludmil Katzarkov

A Steiner triple system, STS$(v)$, is a family of $3$-subsets (blocks) of a set of $v$ elements such that any two elements occur together in precisely one block. A collection of triples consisting of two copies of each block of an STS is…

Combinatorics · Mathematics 2025-04-24 Peter J. Dukes , Esther R. Lamken