English
Related papers

Related papers: Steiner triple systems without parallel classes

200 papers

We give new Turing machines that simulate the iteration of the Collatz 3x+1 function. First, a never halting Turing machine with 3 states and 4 symbols, improving the known 3x5 and 4x4 Turing machines. Second, Turing machines that halt on…

Logic · Mathematics 2014-09-26 Pascal Michel

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

We show that the maximum number of triples on $n$~points, if no three triples span at most five points, is $(1\pm o(1))n^2/5$. More generally, let $f^{(r)}(n;k,s)$ be the maximum number of edges of an $r$-uniform hypergraph on $n$~vertices…

Combinatorics · Mathematics 2018-12-05 Stefan Glock

In this paper, we construct an infinite series of line arrangements in characteristic two, each featuring only triple intersection points. This finding challenges the existing conjecture that suggests the existence of only a finite number…

Combinatorics · Mathematics 2025-05-21 Lukas Kühne , Tomasz Szemberg , Halszka Tutaj-Gasińska

In this paper we introduce modular symmetric designs and use them to study the existence of Hadamard matrices modulo 5. We prove that there exist 5-modular Hadamard matrices of order n if and only if n != 3, 7 (mod 10) or n != 6, 11. In…

Combinatorics · Mathematics 2013-07-09 Moon Ho Lee , Ferenc Szöllősi

Skew-symmetric sum of $N!$ compositions of $N$ vector fields in all possible order is called $N$-commutator. We construct 10-commutator and 13-commutator on a space of vector fields $Vect(3)$ and 10-commutator on a space of divergenceless…

Mathematical Physics · Physics 2007-05-23 A. S. Dzhumadil'daev

We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three classes of the 3-net comprises concurrent lines, and irregular…

Combinatorics · Mathematics 2009-11-23 Aart Blokhuis , Gábor Korchmáros , Francesco Mazzocca

It is well known that the kind of P systems involved in the definition of the P conjecture is able to solve problems in the complexity class $\mathbf{P}$ by leveraging the uniformity condition. Here we show that these systems are indeed…

Computational Complexity · Computer Science 2020-08-05 Alberto Leporati , Luca Manzoni , Giancarlo Mauri , Antonio E. Porreca , Claudio Zandron

We describe some regular techniques of calculating finite degree invariants of triple points free smooth plane curves $S^1 \to R^2$. They are a direct analog of similar techniques for knot invariants and are based on the calculus of {\em…

Geometric Topology · Mathematics 2014-07-29 Victor A. Vassiliev

Consider a set $A$ with no $p$-term arithmetic progressions for $p$ prime. The $p$-Stanley sequence of a set $A$ is generated by greedily adding successive integers that do not create a $p$-term arithmetic progression. For $p>3$ prime, we…

Combinatorics · Mathematics 2017-07-07 Mehtaab Sawhney , Jonathan Tidor

It this paper we study a class of perturbed Hamiltonian systems under perturbations of thirteen order in order to detect the number of limit cycles which bifurcate from some periodic orbits of the unperturbed Hamiltonian system. The system…

Dynamical Systems · Mathematics 2007-05-23 Gheorghe Tigan

We compute the spinor class field for a genus of orders, in a central simple algebra of higher dimension, that are intersections of two maximal orders. In particular, we compute the number of spinor genera in a genus of such orders, as the…

Number Theory · Mathematics 2013-09-24 Luis Arenas-Carmona

There are two particular $\Theta_6$-graphs - the 6-cycle graphs with a diagonal. We find the planar Tur\'an number of each of them, i.e. the maximum number of edges in a planar graph $G$ of $n$ vertices not containing the given $\Theta_6$…

Combinatorics · Mathematics 2024-07-01 David Guan , Ervin Győri , Diep Luong-Le , Felicia Wang , Mengyuan Yang

An algebraic process for the construction of an autotopism for a non-Steiner C-loop is described and this is demonstrated with an example using a known finite C-loop. In every C-loop, two of its parastrophes are not equivalent(equal) it, if…

General Mathematics · Mathematics 2008-06-05 Temitope Gbolahan Jaiyeola , John Olushola Adeniran

It is shown that there exist infinitely many triangular numbers (congruent to 3 mod 12) which cannot be the distance between two perfect numbers.

Number Theory · Mathematics 2012-10-02 Philippe Ellia

A Berge-$K_4$ in a triple system is a configuration with four vertices $v_1,v_2,v_3,v_4$ and six distinct triples $\{e_{ij}: 1\le i< j \le 4\}$ such that $\{v_i,v_j\}\subset e_{ij}$ for every $1\le i<j\le 4$. We denote by $\cal{B}$ the set…

Combinatorics · Mathematics 2018-07-31 Andras Gyarfas

Infinitely many large Schur sigma-groups G with non-elementary bicyclic commutator quotient G/G' = C(3^e) x C(3), e >= 2, are constructed as periodic sequences of vertices in descendant trees of finite 3-groups. A single root gives rise to…

Group Theory · Mathematics 2021-10-27 Daniel C. Mayer

The method of constructing spline classes in the form of trigonometric Fourier series whose coefficients have a certain decreasing order are considered. in turn, this decrement determines the number of continuous derivatives of sum of this…

Numerical Analysis · Mathematics 2019-02-22 V. Denysiuk

This paper is concerned with the construction and convergence analysis of novel implicit Peer triplets of two-step nature with four stages for nonlinear ODE constrained optimal control problems. We combine the property of superconvergence…

Optimization and Control · Mathematics 2022-06-14 Jens Lang , Bernhard A. Schmitt

A mixed Steiner system MS$(t,k,Q)$ is a set (code) $C$ of words of weight $k$ over an alphabet $Q$, where not all coordinates of a word have the same alphabet size, each word of weight $t$, over $Q$, has distance $k-t$ from exactly one…

Combinatorics · Mathematics 2025-07-01 Tuvi Etzion