Related papers: Steiner 3-designs as extensions
Delsarte-Goethals-Seidel showed that if $X$ is a spherical $t$-design with degree $s$ satisfying $t\geq 2s-2$, $X$ carries the structure of an association scheme. Also Bannai-Bannai showed that the same conclusion holds if $X$ is an…
Spanner construction is a well-studied problem and Delaunay triangulations are among the most popular spanners. Tight bounds are known if the Delaunay triangulation is constructed using an equilateral triangle, a square, or a regular…
Let $\F_q^n$ be a vector space of dimension $n$ over the finite field $\F_q$. A $q$-analog of a Steiner system (briefly, a $q$-Steiner system), denoted $S_q[t,k,n]$, is a set $S$ of $k$-dimensional subspaces of $\F_q^n$ such that each…
We introduce the concept of a control contraction metric, extending contraction analysis to constructive nonlinear control design. We derive sufficient conditions for exponential stabilizability of all trajectories of a nonlinear control…
An approximate Steiner tree is a Steiner tree on a given set of terminals in Euclidean space such that the angles at the Steiner points are within a specified error e from 120 degrees.This notion arises in numerical approximations of…
Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is intended for signal transmission, e.g. in chip design or…
We construct a piecewise onto 3-to-1 dynamical system on the positive quadrant of the unit circle, such that for rational points (which correspond to normalized Primitive Pythagorean Triples), the associated ternary expansion is finite, and…
Given a directed graph G and an integer k >= 1, a k-transitive-closure-spanner (k-TCspanner) of G is a directed graph H that has (1) the same transitive-closure as G and (2) diameter at most k. In some applications, the shortcut paths added…
We investigate the XY spin-glass model in two and three dimensions using the domain-wall renormalization-group method. The results for systems of linear sizes up to L=12 (2D) and L=8 (3D) strongly suggest that the lower critical dimension…
The three-body problem is famously chaotic, with no closed-form analytical solutions. However, hierarchical systems of three or more bodies can be stable over indefinite timescales. A system is considered hierarchical if the bodies can be…
We introduce a new model of random $d$-dimensional simplicial complexes, for $d\geq 2$, whose $(d-1)$-cells have bounded degrees. We show that with high probability, complexes sampled according to this model are coboundary expanders. The…
Methods to estimate the Hausdorff dimension of invariant sets of scattering systems are presented. Based on the levels' hierarchical structure of the time delay function, these techniques can be used in systems whose future-invariant-set…
We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size at most $k$. We show that if for some $b \ge i \ge 0$ the shatter function $f_R$ of a set system $([n],R)$ satisfies $f_R(b) < 2^i(b-i+1)$…
In this paper we consider dynamical systems generated by $(3,2)$-rational functions on the field of $p$-adic complex numbers. Each such function has three fixed points. We show that Siegel disks of the dynamical system may either coincide…
We are concerned with the Steiner chains consisting of four circles. More precisely, we deal with the so-called complex moments of Steiner 4-chains introduced in a recent paper by J.Lagarias, C.Mallows and A.Wilks. We compute the invariant…
In this paper we construct new Griesmer codes of dimension $k\geq 5$ by means of some geometric methods such as projective dual and geometric puncturing.
Two vertex-labelled polygons are \emph{compatible} if they have the same clockwise cyclic ordering of vertices. The definition extends to polygonal regions (polygons with holes) and to triangulations---for every face, the clockwise cyclic…
We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of…
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…
We present a concise self-contained inversive geometry solution of the three-circle problem of Steiner of constructing a circle that intersects each of the three given circles at one of the three given angles.