Results 91 to 100 of about 14,274 (218)
Discrete Analysis, 2017 Quasirandom Cayley graphs, Discrete Analysis 2017:6, 14 pp. An extremely important phenomenon in extremal combinatorics is that of _quasirandomness_: for many combinatorial structures, it is possible to identify a list of deterministic properties, each ...
David Conlon, Yufei Zhao
doaj +1 more source
On the extremal combinatorics of the hamming space
Journal of Combinatorial Theory, Series A, 1995 In \(n\)-dimensional Hamming space three points are on a line, if they satisfy the triangle inequality with equality. The paper introduces the following problem: How many different points can be found in the Hamming space so that no three of them are on a line (that is they are in general position)? This maximum value is \(A(n)\). The paper surveys the
openaire +3 more sources
Curves of best approximation on wonderful varieties
Bulletin of the London Mathematical Society, Volume 57, Issue 12, Page 3941-3948, December 2025.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 +2 more
wiley +1 more source
Internal Phase Separation in Synthetic DNA Condensates
Advanced Science, Volume 12, Issue 41, November 6, 2025.The modular, programmable system of DNA nanostructures developed provides programmatic control over multiphase condensate behavior, enabling mapping onto a predictive Flory‐Huggins model. This combined experimental and theoretical framework will help address open questions in condensate biophysics and facilitate the rational design of functional ...
Diana A. Tanase +5 more
wiley +1 more source
Power saving for the Brown-Erdős-Sós problem
Discrete AnalysisPower saving for the Brown-Erdős-Sós problem, Discrete Analysis 2025:5, 16 pp. It has long been known that there are important connections between extremal questions concerning hypergraphs and extremal questions in additive combinatorics.
Oliver Janzer +3 more
doaj +1 more source
Universal models for Lorenz maps
, 1996 The existence of smooth families of Lorenz maps exhibiting all possible dynamical behavior is established and the structure of the parameter space of these families is ...
de Melo, Welington, Martens, Marco
core +1 more source
, 2020 The well-known Sauer lemma states that a family $\mathcal{F}\subseteq 2^{[n]}$ of VC-dimension at most $d$ has size at most $\sum_{i=0}^d\binom{n}{i}$. We obtain both random and explicit constructions to prove that the corresponding saturation number, i ...
Frankl, Nóra +4 more
core
Quasirandom Graphs and the Pantograph Equation. [PDF]
Am Math Mon, 2021 Shapira A, Tyomkyn M.
europepmc +1 more source
On problems in Extremal Combinatorics
, 2016 Extremal Combinatorics studies how large or how small a structure can be, if it does not contain certain forbidden configuration. One of its major areas of study is extremal set theory, where the structures considered are families of sets, and the forbidden configurations are restricted intersection patterns.
openaire +1 more source
High dimensional Hoffman bound and applications in extremal combinatorics [PDF]
, 2022 Yuval Filmus +2 more
openalex +1 more source