Results 61 to 70 of about 887,803 (201)

Curves of best approximation on wonderful varieties

Bulletin of the London Mathematical Society, EarlyView.
Abstract We give an unconditional proof of the Coba conjecture for wonderful compactifications of adjoint type for semisimple Lie groups of type An$A_n$. We also give a proof of a slightly weaker conjecture for wonderful compactifications of adjoint type for arbitrary Lie groups.
Christopher Manon, David McKinnon, Matthew Satriano   +2 more
wiley   +1 more source

Hypergraph removal lemmas via robust sharp threshold theorems

Discrete Analysis, 2020
Hypergraph removal lemmas via robust sharp threshold theorems, Discrete Analysis 2020:10, 46 pp. A central result in additive and extremal combinatorics is the triangle removal lemma, which roughly speaking states that a graph with few triangles can be ...
Noam Lifshitz
doaj   +1 more source

Spaceborne and spaceborn: Physiological aspects of pregnancy and birth during interplanetary flight

Experimental Physiology, EarlyView.
Abstract Crewed interplanetary return missions that are on the planning horizon will take years, more than enough time for initiation and completion of a pregnancy. Pregnancy is viewed as a sequence of processes – fertilization, blastocyst formation, implantation, gastrulation, placentation, organogenesis, gross morphogenesis, birth and neonatal ...
Arun V. Holden
wiley   +1 more source

Extremal, enumerative and probabilistic results on ordered hypergraph matchings

Forum of Mathematics, Sigma
An ordered r-matching is an r-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of r-dimensional orders.
Michael Anastos, Zhihan Jin, Matthew Kwan, Benny Sudakov   +3 more
doaj   +1 more source

Dimer models and conformal structures

Communications on Pure and Applied Mathematics, Volume 79, Issue 2, Page 340-446, February 2026.
Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala, Erik Duse, István Prause, Xiao Zhong   +3 more
wiley   +1 more source

On certain extremal Banach–Mazur distances and Ader's characterization of distance ellipsoids

Mathematika, Volume 72, Issue 1, January 2026.
Abstract A classical consequence of the John Ellipsoid Theorem is the upper bound n$\sqrt {n}$ on the Banach–Mazur distance between the Euclidean ball and any symmetric convex body in Rn$\mathbb {R}^n$. Equality is attained for the parallelotope and the cross‐polytope. While it is known that they are unique with this property for n=2$n=2$ but not for n⩾
Florian Grundbacher, Tomasz Kobos
wiley   +1 more source

Kneser graphs are like Swiss cheese

Discrete Analysis, 2018
Kneser graphs are like Swiss cheese, Discrete Analysis 2018:2, 18 pp. This paper relates two very interesting areas of research in extremal combinatorics: removal lemmas, and influence of variables.
Ehud Friedgut, Oded Regev
doaj   +1 more source

Maximum Shattering

Journal of Combinatorial Designs, Volume 33, Issue 12, Page 456-470, December 2025.
ABSTRACT A family ℱ of subsets of [ n ] = { 1 , 2 , … , n } shatters a set A ⊆ [ n ] if for every A ′ ⊆ A, there is an F ∈ ℱ such that F ∩ A = A '. We develop a framework to analyze f ( n , k , d ), the maximum possible number of subsets of [ n ] of size d that can be shattered by a family of size k.
Noga Alon, Varun Sivashankar, Daniel G. Zhu   +2 more
wiley   +1 more source

Dominating K t‐Models

Journal of Graph Theory, Volume 110, Issue 4, Page 448-456, December 2025.
ABSTRACT A dominating K t‐model in a graph G is a sequence ( T 1 , … , T t ) of pairwise disjoint non‐empty connected subgraphs of G, such that for 1 ⩽ i < j ⩽ t every vertex in T j has a neighbour in T i. Replacing ‘every vertex in T j’ by ‘some vertex in T j’ retrieves the standard definition of K t‐model, which is equivalent to K t being a minor of ...
Freddie Illingworth, David R. Wood
wiley   +1 more source

(Random) Trees of Intermediate Volume Growth

Random Structures &Algorithms, Volume 67, Issue 4, December 2025.
ABSTRACT For every function g:ℝ≥0→ℝ≥0$$ g:{\mathbb{R}}_{\ge 0}\to {\mathbb{R}}_{\ge 0} $$ that grows at least linearly and at most exponentially, if it is sufficiently well‐behaved, we can construct a tree T$$ T $$ of uniform volume growth g$$ g $$, or more precisely, C1·g(r/4)≤|BG(v,r)|≤C2·g(4r),for allr≥0andv∈V(T),$$ {C}_1\cdotp g\left(r/4\right)\le \
George Kontogeorgiou, Martin Winter
wiley   +1 more source