English
Related papers

Related papers: Steiner triple systems without parallel classes

200 papers

A triple system is cancellative if it does not contain three distinct sets $A,B,C$ such that the symmetric difference of $A$ and $B$ is contained in $C$. We show that every cancellative triple system $\mathcal{H}$ that satisfies certain…

Combinatorics · Mathematics 2021-03-30 Xizhi Liu

With each Steiner triple system there is associated a one-parameter family of commutative, nonassociative, nonunital algebras that are by construction exact, meaning that the trace of every multiplication operator vanishes, and these…

Rings and Algebras · Mathematics 2022-06-13 Daniel J. F. Fox

We study the minimum degree necessary to guarantee the existence of perfect and almost-perfect triangle-tilings in an $n$-vertex graph $G$ with sublinear independence number. In this setting, we show that if $\delta(G) \ge n/3 + o(n)$ then…

Combinatorics · Mathematics 2016-07-27 József Balogh , Andrew McDowell , Theodore Molla , Richard Mycroft

We introduce Poisson triple systems, which are vector spaces with 3 trilinear operations satisfying 9 polynomial identities of degree 5. We show that every Poisson triple system has a universal enveloping Poisson algebra. Finally, we…

Rings and Algebras · Mathematics 2025-07-18 Murray Bremner , Hader Elgendy

Scattered sequences are a generalization of scattered polynomials. So far, only scattered sequences of order one and two have been constructed. In this paper an infinite family of scattered sequences of order three is obtained. Equivalence…

Combinatorics · Mathematics 2023-08-11 Daniele Bartoli , Alessandro Giannoni

In this paper we give the first construction of a q-analog of a Steiner system. Using a computer search we found at least 26 q-Steiner Systems S_2[2,3,13] admitting the normalizer of a singer cycle as a group of automorphisms.

Combinatorics · Mathematics 2012-11-13 Michael Braun , Alfred Wassermann

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

Computational Geometry · Computer Science 2007-05-23 Jeff Danciger , Satyan L. Devadoss , Don Sheehy

Taking inspiration from [1, 21, 24], we develop a general framework to deal with the model theory of open incidence structures. In this first paper we focus on the study of systems of points and lines (rank $2$). This has a number of…

Logic · Mathematics 2024-12-03 Gianluca Paolini , Davide Emilio Quadrellaro

We answered the old question: does there exist a mechanical system with 3 degrees of freedom, except for the Coulomb system, which has 6 first integrals generating the Lie algebra o(4) by means of the Poisson brackets? We presented a system…

Classical Physics · Physics 2020-12-11 Sofiane Bouarroudj , S. E. Konstein

Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…

Combinatorics · Mathematics 2013-02-26 György Elekes , Endre Szabó

We study the phase transition between the Coulomb liquid and the columnar crystal in the 3D classical dimer model, which was found to be continuous in the O(3) universality class. In addition to nearest neighbor interactions which favor…

Strongly Correlated Electrons · Physics 2011-08-12 Stefanos Papanikolaou , Joseph J. Betouras

A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 was recently carried out in [P. R. J. \"Osterg{\aa}rd and O. Pottonen, "The perfect binary one-error-correcting…

Information Theory · Computer Science 2010-10-07 Patric R. J. Östergård , Olli Pottonen , Kevin T. Phelps

The Kramer-Mesner method for constructing designs with a prescribed automorphism group $G$ has proven effective many times. In the special case of Steiner designs, the task reduces to solving an exact cover problem, with the advantage that…

The well-known Steinberg's conjecture asserts that any planar graph without 4- and 5-cycles is 3 colorable. In this note we have given a short algorithmic proof of this conjecture based on the spiral chains of planar graphs proposed in the…

Combinatorics · Mathematics 2007-05-23 I. Cahit

We classify thick irreducible 3-spherical twin buildings of rank at least 3 in which every panel contains at least 6 chambers. Together with the Main result of [11] we obtain a classification of thick irreducible 3-spherical twin buildings.

Group Theory · Mathematics 2023-07-19 Sebastian Bischof

We reach beyond the celebrated theorems of Erd\H{o}s-Ko-Rado and Hilton-Milner, and, a recent theorem of Han-Kohayakawa, and determine all maximal intersecting triples systems. It turns out that for each $n\ge7$ there are exactly 15…

Combinatorics · Mathematics 2016-08-23 Joanna Polcyn , Andrzej Rucinski

In this paper we construct a third order method for solving additively split autonomous stiff systems of ordinary differential equations. The constructed additive method is L-stable with respect to the implicit part and allows to use an…

Numerical Analysis · Mathematics 2009-02-19 Evgeny Novikov , Anton Tuzov

A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on…

Statistical Mechanics · Physics 2007-05-23 Iwan Jensen

The identity of the smallest quadrangulation with minimum degree 3 also containing parallel edges is unknown. However, it has already been determined that its order (the number of vertices) is between 11 and 14. This paper narrows this…

Combinatorics · Mathematics 2017-11-21 Richard Kapolnai , Gabor Domokos , Imre Szeberenyi

We explore the enumeration of some natural classes of graded posets, including all graded posets, (2+2)- and (3+1)-avoiding graded posets, (2+2)-avoiding graded posets, and (3+1)-avoiding graded posets. We obtain enumerative and structural…

Combinatorics · Mathematics 2015-08-05 Yan X. Zhang
‹ Prev 1 4 5 6 7 8 10 Next ›