English
Related papers

Related papers: Steiner 3-designs as extensions

200 papers

Given two sets of points in the plane, $P$ of $n$ terminals and $S$ of $m$ Steiner points, a Steiner tree of $P$ is a tree spanning all points of $P$ and some (or none or all) points of $S$. A Steiner tree with length of longest edge…

Computational Geometry · Computer Science 2010-12-08 A. Karim Abu-Affash

Following a suggestion of W.M. Schmidt and L. Summerer, we construct a proper $3$-system $(P_{1},P_{2},P_{3})$ with the property $\overline{\varphi}_{3}=1$. In fact, our method generalizes to provide $n$-systems with…

Number Theory · Mathematics 2021-01-12 Johannes Schleischitz

(I) We exhibit a set of 23 points in the plane that has dilation at least $1.4308$, improving the previously best lower bound of $1.4161$ for the worst-case dilation of plane spanners. (II) For every integer $n\geq13$, there exists an…

Computational Geometry · Computer Science 2016-04-25 Adrian Dumitrescu , Anirban Ghosh

We show how the variational characterisation of spherical designs can be used to take a union of spherical designs to obtain a spherical design of higher order (degree, precision, exactness) with a small number of points. The examples that…

Metric Geometry · Mathematics 2019-12-17 Mozhgan Mohammadpour , Shayne Waldron

Superintegrable systems of 2nd order in 3 dimensions with exactly 3-parameter potentials are intriguing objects. Next to the nondegenerate 4-parameter potential systems they admit the maximum number of symmetry operators but their symmetry…

Mathematical Physics · Physics 2017-03-08 M. A. Escobar-Ruiz , W. Miller

In this paper, we prove the existence of a spherical $t$-design formed by adding extra points to an arbitrarily given point set on the sphere and, subsequently, deduce the existence of nested spherical designs. Estimates on the number of…

Functional Analysis · Mathematics 2024-05-20 Ruigang Zheng , Xiaosheng Zhuang

We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…

Combinatorics · Mathematics 2023-02-15 Peter Keevash , Ashwin Sah , Mehtaab Sawhney

We consider rotational beta expansions in dimensions 1, 2 and 4 and view them as expansions on real numbers, complex numbers, and quaternions, respectively. We give sufficient conditions on the parameters $\alpha, \beta \in (0,1)$ so that…

Number Theory · Mathematics 2025-06-17 Hajime Kaneko , Jonathan Caalim , Nathaniel Nollen

Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point sets with many collinear triples. In this work we consider…

Combinatorics · Mathematics 2018-03-13 Zeev Dvir , Ankit Garg , Rafael Oliveira , József Solymosi

A maximal arc of degree k in a finite projective plane P of order q = ks is a set of (q-s+1)k points that meets every line of P in either k or 0 points. The collection of the nonempty intersections of a maximal arc with the lines of P is a…

Combinatorics · Mathematics 2024-03-06 Zazil Santizo Huerta , Melissa Keranen , Vladimir Tonchev

The $q$-analogs of basic designs are discussed. It is proved that the existence of any unknown Steiner structures, the $q$-analogs of Steiner systems, implies the existence of unknown Steiner systems. Optimal $q$-analogs covering designs…

Combinatorics · Mathematics 2015-03-13 Tuvi Etzion , Alexander Vardy

In this paper, we obtain new lower and upper bounds for the problem of bipartite biregular cages. Moreover, for girth $6$, we give the exact parameters of the $(m,n;6)$-bipartite biregular cages when $n\equiv -1$ $\pmod m$ using the…

Combinatorics · Mathematics 2023-10-19 Gabriela Araujo-Pardo , György Kiss , Tamás Szönyi

We are concerned with the invariants of Steiner chains consisting of four circles. In particular, we compute the invariant moments of curvatures in Steiner 4-chains and give two applications of the obtained formulas. Specifically, we…

Combinatorics · Mathematics 2025-05-13 Guna Bibileishvili , Ana Diakvnishvili

S-type planets, which orbit one component of multiple-star systems, place strong constraints on the planet formation and evolution models. A notable case study is Kepler-444, a triple-star system whose primary is orbited by five planets…

Earth and Planetary Astrophysics · Physics 2022-11-23 M. Stalport , E. C. Matthews , V. Bourrier , A. Leleu , J. -B. Delisle , S. Udry

We provide a method to construct $t$-designs from weighing matrices and association schemes. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to…

Combinatorics · Mathematics 2026-04-14 Gary Greaves , Sho Suda

Lightness is a fundamental parameter for Euclidean spanners; it is the ratio of the spanner weight to the weight of the minimum spanning tree of a finite set of points in $\mathbb{R}^d$. In a recent breakthrough, Le and Solomon (2019)…

Computational Geometry · Computer Science 2021-03-30 Sujoy Bhore , Csaba D. Tóth

The Euclidean Steiner tree problem, normally posed in two dimensions, seeks to connect a set of prescribed terminal nodes by placing additional nodes, known as Steiner points, with edges connecting such nodes either to another Steiner point…

Systems and Control · Electrical Eng. & Systems 2026-04-24 Manou Rosenberg , Mengbin Ye , Brian D. O. Anderson

We construct Steiner triple systems without parallel classes for an infinite number of orders congruent to $3 \pmod{6}$. The only previously known examples have order $15$ or $21$.

Combinatorics · Mathematics 2020-07-28 Darryn Bryant , Daniel Horsley

We initiate the study of extended bicolorings of Steiner triple systems (STS) which start with a $k$-bicoloring of an STS($v$) and end up with a $k$-bicoloring of an STS($2v+1$) obtained by a doubling construction, using only the original…

Combinatorics · Mathematics 2013-08-23 M. Gionfriddo , E. Guardo , L. Milazzo

We consider the problem of embedding the Steiner points of a Steiner tree with given topology into the rectilinear plane. Thereby, the length of the path between a distinguished terminal and each other terminal must not exceed given length…

Data Structures and Algorithms · Computer Science 2015-08-19 Jens Maßberg