Related papers: Strongly minimal Steiner Systems III: Path graphs …
We give sufficient conditions for stability of a continuous-time linear switched system consisting of finitely many subsystems. The switching between subsystems is governed by an underlying graph. The results are applicable to switched…
We study density requirements on a given Banach space that guarantee the existence of subsymmetric basic sequences by extending Tsirelson's well-known space to larger index sets. We prove that for every cardinal $\kappa$ smaller than the…
In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…
A spanning tree $T$ of graph $G$ is a $\rho$-approximate universal Steiner tree (UST) for root vertex $r$ if, for any subset of vertices $S$ containing $r$, the cost of the minimal subgraph of $T$ connecting $S$ is within a $\rho$ factor of…
In this article, we construct a Steiner system with the parameters $S(3,6,42)$, settling one of the smallest open parameter sets of Steiner $3$-designs. Furthermore, we establish the existence of rotational Steiner quadruple systems on $46$…
We investigate the automorphism groups of $\aleph\_0$-categorical structures and prove that they are exactly the Roelcke precompact Polish groups. We show that the theory of a structure is stable if and only if every Roelcke uniformly…
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…
In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod…
In 1973 Erdos asked whether there are n-vertex partial Steiner triple systems with arbitrary high girth and quadratically many triples. (Here girth is defined as the smallest integer g \ge 4 for which some g-element vertex-set contains at…
A Steiner triple system STS$(v)$ is called $f$-pyramidal if it has an automorphism group fixing $f$ points and acting sharply transitively on the remaining $v-f$ points. In this paper, we focus on the STSs that are $f$-pyramidal over some…
The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…
The sparsity order of a (simple undirected) graph is the highest possible rank (over ${\mathbb R}$ or ${\mathbb C}$) of the extremal elements in the matrix cone that consists of positive semidefinite matrices with prescribed zeros on the…
We use basic tools of descriptive set theory to prove that a closed set $\mathcal S$ of marked groups has $2^{\aleph_0}$ quasi-isometry classes provided every non-empty open subset of $\mathcal S$ contains at least two non-quasi-isometric…
We prove that there exists an absolute constant $C>0$ such that, for any positive integer $k$, every graph $G$ with minimum degree at least $Ck$ admits a vertex-partition $V(G)=S\cup T$, where both $G[S]$ and $G[T]$ have minimum degree at…
We note that a strongly minimal Steiner $k$-Steiner system $(M,R)$ from (Baldwin-Paolini 2020) can be `coordinatized' in the sense of (Gantner-Werner 1975) by a quasigroup if $k$ is a prime-power. But for the basic construction this…
The aim of this article is to extend the results of Asadi M.B, B.V.R. Bhat, G. Ramesh, K. Sumesh about completely positive maps on Hilbert C*-modules. We prove a Stinespring type theorem for a finite family of completely positive maps on…
A celebrated theorem of Pippenger, and Frankl and R\"odl states that every almost-regular, uniform hypergraph $\mathcal{H}$ with small maximum codegree has an almost-perfect matching. We extend this result by obtaining a ``conflict-free''…
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constant $c$ such that there is an infinite family of 4-regular 4-connected graphs, each containing exactly $c$ hamiltonian cycles. We complement…
In this paper we analyze the approximation of stable linear time-invariant systems, like the Hilbert transform, by sampling series for bandlimited functions in the Paley-Wiener space $\mathcal{PW}_{\pi}^{1}$. It is known that there exist…