Results 91 to 100 of about 887,124 (211)

Monotonicity of functionals associated to product measures via their Fourier transform and applications

Mathematika, Volume 71, Issue 4, October 2025.
Abstract Let μ$\mu$ be a probability measure on R$\mathbb {R}$. We give conditions on the Fourier transform of its density for functionals of the form H(a)=∫Rnh(⟨a,x⟩)μn(dx)$H(a)=\int _{\mathbb {R}^n}h(\langle a,x\rangle)\mu ^n(dx)$ to be Schur monotone. As applications, we put certain known and new results under the same umbrella, given by a condition
Andreas Malliaris
wiley   +1 more source

Crossing estimates for the Ising model on general s‐embeddings

Proceedings of the London Mathematical Society, Volume 131, Issue 4, October 2025.
Abstract We prove Russo–Seymour–Welsh‐type crossing estimates for the FK–Ising model on general s‐embeddings whose origami map has an asymptotic Lipschitz constant strictly smaller than 1, provided it satisfies a mild non‐degeneracy assumption. This result extends the work of Chelkak and provides a general framework to prove that the usual connection ...
Rémy Mahfouf
wiley   +1 more source

Power saving for the Brown-Erdős-Sós problem

Discrete Analysis
Power 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, Abhishek Methuku, Aleksa Milojević, Benny Sudakov   +3 more
doaj   +1 more source

Enumeration and Construction of Row‐Column Designs

Journal of Combinatorial Designs, Volume 33, Issue 9, Page 357-372, September 2025.
ABSTRACT We computationally completely enumerate a number of types of row‐column designs up to isotopism, including double, sesqui, and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO‐arrays. We calculate autotopism group sizes for the designs we generate.
Gerold Jäger, Klas Markström, Denys Shcherbak, Lars‐Daniel Öhman   +3 more
wiley   +1 more source

Intersection Problems in Extremal Combinatorics: Theorems, Techniques and Questions Old and New [PDF]

, 2022
Anthony Nixon, Anthony Nixon, Anthony Nixon   +2 more
openalex   +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

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   +2 more sources

Quasirandom Graphs and the Pantograph Equation. [PDF]

Am Math Mon, 2021
Shapira A, Tyomkyn M.
europepmc   +1 more source

An extremal problem on potentially $K_{m}-P_{k}$-graphic sequences

, 2005
A sequence $S$ is potentially $K_{m}-P_{k}$ graphical if it has a realization containing a $K_{m}-P_{k}$ as a subgraph. Let $\sigma(K_{m}-P_{k}, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $\sigma(S)\geq \sigma(
Lai, Chunhui
core   +1 more source

Intersection Problems in Extremal Combinatorics: Theorems, Techniques and Questions Old and New

, 2021
David Ellis
openalex   +2 more sources