Complete Arcs in Steiner Triple Systems
A complete arc in a Steiner triple system of order \(v\), \(\text{STS}(v)\), is a set of \(s\) points met by any block in at most two points and such that the 2-secant blocks cover all points outside the arc. The authors determine the spectrum of sizes of complete arcs in Steiner triple systems; namely, they prove the following theorem: If \(v\equiv 1,
Charles J. Colbourn, Jeffrey H. Dinitz
openaire +1 more source
Industry Portfolio Volatility Connections and Industry Portfolio Returns
ABSTRACT This paper tracks dynamic connections that form among daily US industry portfolio return volatilities using a Bayesian time‐varying parameter VAR model. Market participants often focus on sectors to filter vast amounts of information, and this focus results in cross‐industry return predictability. We characterise connections that form over the
Michael Ellington +2 more
wiley +1 more source
Rigid Steiner triple systems obtained from projective triple systems
It was shown by Babai in 1980 that almost all Steiner triple systems are rigid; that is, their only automorphism is the identity permutation. Those Steiner triple systems with the largest automorphism groups are the projective systems of orders $2^n-1 ...
M. Knor +3 more
core +1 more source
Sparse Steiner triple systems of order 21
A (Formula presented.) -configuration is a set of (Formula presented.) blocks on (Formula presented.) points. For Steiner triple systems, (Formula presented.) -configurations are of particular interest.
Kokkala, Janne I. +4 more
core +1 more source
This review focuses on spatial omics, covering the introduction and comparison of technology platforms, explanation and recommendation of algorithm ecology, demonstration of biological applications, and prospect of large models. It aims to help researchers in the interdisciplinary field of spatial omics quickly understand the current situation and ...
Haoxiu Wang +26 more
wiley +1 more source
Some Constructions of Steiner Triple Systems of Type v⟶2v + 1 + 6k
A Steiner Triple System (STS) of order v is a hypergraph Σ=(X,B) that is uniform of rank 3 and has order v, such that every 2-subset of X has degree 1.
Leonardo Fragapane, Mario Gionfriddo
doaj +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
ABSTRACT A weak c $c$‐colouring of a design is an assignment of colours to its points from a set of c $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
Phanerozoic Large Igneous Province, Petroleum System, and Source Rock Links
Exploring the links between Large Igneous Provinces and dramatic environmental impact
An emerging consensus suggests that Large Igneous Provinces (LIPs) and Silicic LIPs (SLIPs) are a significant driver of dramatic global environmental and biological changes, including mass extinctions.
Steven C. Bergman +2 more
wiley +1 more source
Continuity of Mendelsohn and Steiner triple systems
By adopting a functional viewpoint of Mendelsohn and Steiner triple systems, questions of continuity are investigated. The main result is that at most one section of a Steiner triple system defined on the real line can be continuous. Applying the concept
Phelan, J.S. +2 more
core +1 more source
A proof of the Elliott–Rödl conjecture on hypertrees in Steiner triple systems
Hypertrees are linear hypergraphs where every two vertices are connected by a unique path. Elliott and Rödl conjectured that for any given $\mu>0$ , there exists $n_0$ such that the following holds.
Seonghyuk Im +3 more
doaj +1 more source

