Results 61 to 70 of about 58,072 (195)

Various Problems in Extremal Combinatorics [PDF]

open access: yes, 2012
Extremal combinatorics is a central theme of discrete mathematics. It deals with the problems of finding the maximum or minimum possible cardinality of a collection of finite objects satisfying certain restrictions.
Huang, Hao
core  

Convergence and combinatorics of the Reverse algorithm

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 9, September 2026.
Abstract We study the Reverse algorithm, a multidimensional continued fraction algorithm, which is not unimodular. We show that the Reverse algorithm is ergodic and, by proving that its second Lyapunov exponent is negative, that it is a.e. exponentially convergent.
Hiroaki Ito   +2 more
wiley   +1 more source

Kneser graphs are like Swiss cheese

open access: yesDiscrete 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

Cauchy identities for staircase matrices

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 3, September 2026.
Abstract The well‐known Cauchy identity expresses the product of terms (1−xiyj)−1${(1-{x}_{i}{y}_{j})}^{-1}$ for (i,j)$(i,j)$ indexing entries of a rectangular m×n$m\ensuremath{\times{}}n$‐matrix as a sum over partitions λ$\lambda $ of products of Schur polynomials: sλ(x)sλ(y)${s}_{\lambda}(x){s}_{\lambda}(y)$.
Evgeny Feigin   +2 more
wiley   +1 more source

Metric spaces with small rough angles and the rectifiability of rough self‐contracted curves

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 3, September 2026.
Abstract The small rough angle (SRA$\operatorname{SRA}$) condition, introduced by Zolotov in arXiv:1804.00234, captures the idea that all angles formed by triples of points in a metric space are small. In the first part of the paper, we develop the theory of metric spaces (X,d)$(X,d)$ satisfying the SRA(α)$\operatorname{SRA}(\alpha)$ condition for some
Estibalitz Durand Cartagena   +1 more
wiley   +1 more source

Extensions of Classic Theorems in Extremal Combinatorics [PDF]

open access: yes, 2014
Extremal combinatorics deals with the following fundamental question: how large can a structure be without containing forbidden configurations? The structures studied are extremely flexible, allowing for a wide range of applications to diverse fields ...
Das, Shagnik
core  

International Journal of Mathematical Combinatorics, Vol.3 [PDF]

open access: yes, 2009
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core   +1 more source

Undecidability of polynomial inequalities in weighted graph homomorphism densities

open access: yesForum of Mathematics, Sigma
Many problems and conjectures in extremal combinatorics concern polynomial inequalities between homomorphism densities of graphs where we allow edges to have real weights.
Grigoriy Blekherman   +2 more
doaj   +1 more source

Effective length‐projection bounds for hyperbolic 3‐manifolds diffeomorphic to S×R$S\times \mathbb {R}$

open access: yesJournal of Topology, Volume 19, Issue 3, September 2026.
Abstract We give a formula with explicit constants relating the subsurface projection dY(ν−,ν+)$d_Y(\nu ^-,\nu ^+)$ of the end invariants ν−,ν+$\nu ^-,\nu ^+$ of a hyperbolic 3‐manifold Q$Q$ diffeomorphic to S×R$S\times \mathbb {R}$ and the length of the geodesic representative in Q$Q$ of the multicurve ∂Y$\partial Y$.
Gabriele Viaggi
wiley   +1 more source

Home - About - Disclaimer - Privacy