English
Related papers

Related papers: Cancellative hypergraphs and Steiner triple system…

200 papers

A holomorphic vector bundle on a Calabi-Yau threefold, X, with h^{1,1}(X)>1 can have regions of its Kahler cone where it is slope-stable, that is, where the four-dimensional theory is N=1 supersymmetric, bounded by "walls of stability". On…

High Energy Physics - Theory · Physics 2014-11-20 Lara B. Anderson , James Gray , Burt Ovrut

We show that six-dimensional backgrounds that are T^2 bundle over a Calabi-Yau two-fold base are consistent smooth solutions of heterotic flux compactifications. We emphasize the importance of the anomaly cancellation condition which can…

High Energy Physics - Theory · Physics 2008-11-26 Katrin Becker , Melanie Becker , Ji-Xiang Fu , Li-Sheng Tseng , Shing-Tung Yau

It is known that in any $r$-coloring of the edges of a complete $r$-uniform hypergraph, there exists a spanning monochromatic component. Given a Steiner triple system on $n$ vertices, what is the largest monochromatic component one can…

Combinatorics · Mathematics 2020-02-11 Louis DeBiasio , Michael Tait

Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…

Combinatorics · Mathematics 2020-12-07 Simona Bonvicini , Marco Buratti , Martino Garonzi , Gloria Rinaldi , Tommaso Traetta

We establish necessary and sufficient conditions for invertibility of symmetric three-by-three block matrices having a double saddle-point structure \fb{that guarantee the unique solvability of double saddle-point systems}. We consider…

Numerical Analysis · Mathematics 2024-07-04 Fatemeh P. A. Beik , Chen Greif , Manfred Trummer

A fundamental barrier in extremal hypergraph theory is the presence of many near-extremal constructions with very different structures. Indeed, the classical constructions due to Kostochka imply that the notorious extremal problem for the…

Combinatorics · Mathematics 2021-03-23 Xizhi Liu , Dhruv Mubayi

Let $n$, $k$, and $t$ be integers satisfying $n>k>t\ge2$. A Steiner system with parameters $t$, $k$, and $n$ is a $k$-uniform hypergraph on $n$ vertices in which every set of $t$ distinct vertices is contained in exactly one edge. An…

Combinatorics · Mathematics 2013-03-19 Asaf Ferber , Rani Hod , Michael Krivelevich , Benny Sudakov

We examine the stability of hierarchical triple systems using direct $N$-body simulations without adopting a secular perturbation approximation. We estimate their disruption timescales in addition to the mere stable/unstable criterion, with…

Solar and Stellar Astrophysics · Physics 2022-11-16 Toshinori Hayashi , Alessandro A. Trani , Yasushi Suto

Based on an explicit model, we propose and discuss the generic features of a possible implementation of the Twin Higgs program in the context of composite Higgs models. We find that the Twin Higgs quadratic divergence cancellation argument…

High Energy Physics - Phenomenology · Physics 2015-09-04 Riccardo Barbieri , Davide Greco , Riccardo Rattazzi , Andrea Wulzer

It follows from known results that every regular tripartite hypergraph of positive degree, with $n$ vertices in each class, has matching number at least $n/2$. This bound is best possible, and the extremal configuration is unique. Here we…

Combinatorics · Mathematics 2017-01-24 Penny Haxell , Lothar Narins

Motivated by a result of [1] which states that if F is a subgraph of a convex complete graph K_n and F contains no boundary edge of K_n and |E(F)| \leq n-3, then K_n - F admits a triangulation, we determine necessary and sufficient…

Combinatorics · Mathematics 2016-11-29 Niran Abbas Ali , Gek L. Chia , Hazim Michman Trao , Adem Kilicman

The well-known Steinberg's conjecture asserts that any planar graph without 4- and 5-cycles is 3 colorable. In this note we have given a short algorithmic proof of this conjecture based on the spiral chains of planar graphs proposed in the…

Combinatorics · Mathematics 2007-05-23 I. Cahit

A graph is $(c_1, c_2, ..., c_k)$-colorable if the vertex set can be partitioned into $k$ sets $V_1,V_2, ..., V_k$, such that for every $i: 1\leq i\leq k$ the subgraph $G[V_i]$ has maximum degree at most $c_i$. We show that every planar…

Combinatorics · Mathematics 2012-08-17 Owen Hill , Gexin Yu

In 2014, Keevash proved the existence of $(n,q,r)$-Steiner systems (equivalently $K_q^r$-decompositions of $K_n^r$) for all large enough $n$ satisfying the necessary divisibility conditions. In 2021, Glock, K\"uhn, and Osthus proposed a…

Combinatorics · Mathematics 2025-12-04 Cicely Henderson , Luke Postle

In this paper we study Tur\'an and Ramsey numbers in linear triple systems, defined as $3$-uniform hypergraphs in which any two triples intersect in at most one vertex. A famous result of Ruzsa and Szemer\'edi is that for any fixed $c>0$…

Combinatorics · Mathematics 2020-11-30 Andras Gyarfas , Gabor N. Sarkozy

We propose a new approach to studies on partial Steiner triple systems consisting in determining complete graphs contained in them. We establish the structure which complete graphs yield in a minimal PSTS that contains them. As a by-product…

Combinatorics · Mathematics 2014-10-30 M. Prażmowska , K. Prażmowski

The Bounded Negativity Conjecture predicts that for every complex projective surface $X$ there exists a number $b(X)$ such that $C^2\geq -b(X)$ holds for all reduced curves $C\subset X$. For birational surfaces $f:Y\to X$ there have been…

Algebraic Geometry · Mathematics 2023-04-20 Piotr Pokora , Xavier Roulleau , Tomasz Szemberg

We give the first exact and stability results for a hypergraph Tur\'{a}n problem with infinitely many extremal constructions that are far from each other in edit-distance. This includes an example of triple systems with Tur\'{a}n density…

Combinatorics · Mathematics 2023-12-04 Jianfeng Hou , Heng Li , Xizhi Liu , Dhruv Mubayi , Yixiao Zhang

A partial Steiner triple system of order n is sequenceable if there is a sequence of length n of its distinct points such that no proper segment of the sequence is a union of point-disjoint blocks. We prove that if a partial Steiner triple…

Combinatorics · Mathematics 2019-07-26 Brian Alspach , Donald L. Kreher , Adrián Pastine

Three $k$-dimensional subspaces $A$, $B$, and $C$ of an $n$-dimensional vector space $V$ over a finite field are called a $3$-cluster if $A \cap B \cap C = \{\mathbf{0}_V\}$ and yet $\dim(A+B+C) \leq 2k$. A special kind of $3$-cluster,…

Combinatorics · Mathematics 2024-03-11 Gabriel Currier , Shahriar Shahriari