English
Related papers

Related papers: Cancellative hypergraphs and Steiner triple system…

200 papers

The theory of small cancellation groups is well known. In this paper we introduce the notion of Group-like Small Cancellation Ring. This is the main result of the paper. We define this ring axiomatically, by generators and defining…

Rings and Algebras · Mathematics 2022-06-16 A. Atkarskaya , A. Kanel-Belov , E. Plotkin , E. Rips

Given a $2$-$(v,k,\lambda)$ design, $\cal{S}=(X,\cal{B})$, a {\it zero-sum $n$-flow} of $\cal{S}$ is a map $f: \cal{B} \longrightarrow \{\pm 1, \ldots ,\pm (n-1)\}$ such that for any point $x\in X$, the sum of $f$ around all the blocks…

Combinatorics · Mathematics 2015-05-13 S. Akbari , A. C. Burgess , P. Danziger , E. Mendelsohn

We investigate for which classes of (potentially infinite) graphs the clique dynamics is cover stable, i. e., when clique convergence/divergence is preserved under triangular covering maps. We first present an instructive counterexample: a…

Combinatorics · Mathematics 2025-04-01 Anna M. Limbach , Martin Winter

This paper is motivated by recent developments in group stability, high dimensional expansion, local testability of error correcting codes and topological property testing. In Part I, we formulate and motivate three stability problems: 1.…

Group Theory · Mathematics 2024-04-02 Michael Chapman , Alexander Lubotzky

Free Steiner triple systems (STS) are infinite structures that are naturally characterised by a universal property. We consider the class of free STSs from a model theoretic viewpoint. We show that free STSs on any number of generators are…

Logic · Mathematics 2026-02-25 Silvia Barbina , Enrique Casanovas

A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in…

Metric Geometry · Mathematics 2015-01-05 Jinsong Liu , Ze Zhou

The paper deals with a problem of Additive Combinatorics. Let ${\mathbf G}$ be a finite abelian group of order $N$. We prove that the number of subset triples $A,B,C\subset {\mathbf G}$ such that for any $x\in A$, $y\in B$ and $z\in C$ one…

Number Theory · Mathematics 2020-12-29 Aliaksei Semchankau , Dmitry Shabanov , Ilya Shkredov

A fundamental aspect of the three-body problem is its stability. Most stability studies have focused on the co-planar three-body problem, deriving analytic criteria for the dynamical stability of such pro/retrograde systems. Numerical…

Earth and Planetary Astrophysics · Physics 2016-12-02 Evgeni Grishin , Hagai B. Perets , Yossef Zenati , Erez Michaely

This paper establishes limit theorems and quantitative statistical stability for a class of piecewise partially hyperbolic maps that are not necessarily continuous nor locally invertible. By employing a flexible functional-analytic…

Dynamical Systems · Mathematics 2026-02-20 Rafael A. Bilbao , Rafael Lucena

The neighborhood of a pair of vertices $u,v$ in a triple system is the set of vertices $w$ such that $uvw$ is an edge. A triple system $\HH$ is semi-bipartite if its vertex set contains a vertex subset $X$ such that every edge of $\HH$…

Combinatorics · Mathematics 2010-02-10 Jozsef Balogh , Dhruv Mubayi

A graph is k-choosable if it can be colored whenever every vertex has a list of at least k available colors. We prove that if cycles of length at most four in a planar graph G are pairwise far apart, then G is 3-choosable. This is analogous…

Combinatorics · Mathematics 2012-05-28 Z. Dvorak

A $\delta$-colouring of the point set of a block design is said to be {\em weak} if no block is monochromatic. The {\em chromatic number} $\chi(S)$ of a block design $S$ is the smallest integer $\delta$ such that $S$ has a weak…

Combinatorics · Mathematics 2025-04-17 Andrea C. Burgess , Nicholas J. Cavenagh , Peter Danziger , David A. Pike

Given positive integers $a\leq b \leq c$, let $K_{a,b,c}$ be the complete 3-partite 3-uniform hypergraph with three parts of sizes $a,b,c$. Let $H$ be a 3-uniform hypergraph on $n$ vertices where $n$ is divisible by $a+b+c$. We…

Combinatorics · Mathematics 2017-08-15 Jie Han , Chuanyun Zang , Yi Zhao

There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already…

Combinatorics · Mathematics 2024-05-28 Peter Frankl , Zoltán Füredi , Ido Goorevitch , Ron Holzman , Gábor Simonyi

One of the key unsolved conjectures in hypergraph coloring is about the chromatic number of $s$-stable $r$-uniform Kneser hypergraphs $\mathrm{KG}^r(n,k)_{s\textup{-stab}}$. The problem remains largely open, particularly in the case where…

Combinatorics · Mathematics 2025-09-29 Hamid Reza Daneshpajouh

We revisit the relation between the anomalies in four and six dimensions and the Chern-Simons couplings one dimension below. While the dimensional reduction of chiral theories is well-understood, the question which three and…

High Energy Physics - Theory · Physics 2022-02-02 Peng Cheng , Ruben Minasian , Stefan Theisen

In this paper we extend three results about polycycles (also known as graphs) of planar smooth vector field to planar non-smooth vector fields (also known as piecewise vector fields, or Filippov systems). The polycycles considered here may…

Dynamical Systems · Mathematics 2024-05-08 Paulo Santana

We study finite systems of subspaces of a complex Hilbert space such that each pair of subspaces satisfies a certain condition as described in the following. For each subspace excepting the first one an angle between this subspace and the…

Functional Analysis · Mathematics 2012-01-18 Ivan Feshchenko , Alexander Strelets

In 2000, Rees and Shalaby constructed simple indecomposable two-fold cyclic triple systems for all v congruent to 0, 1, 3, 4, 7, and 9 (mod 12) where v = 4 or v>11, using Skolem-type sequences. We construct, using Skolem-type sequences,…

Combinatorics · Mathematics 2014-04-03 Nabil Shalaby , Bradley Sheppard , Daniela Silvesan

A bi-Hamiltonian formulation is proposed for triangular systems resulted by perturbations around solutions, from which infinitely many symmetries and conserved functionals of triangular systems can be explicitly constructed, provided that…

Exactly Solvable and Integrable Systems · Physics 2009-11-07 Wen-Xiu Ma
‹ Prev 1 4 5 6 7 8 10 Next ›