Results 81 to 90 of about 934 (196)
Problems in Discrete Geometry and Extremal Combinatorics
, 2018 We study several problems in discrete geometry and extremal combinatorics. Discrete geometry studies the combinatorial properties of finite sets of simple geometric objects. One theme of the field is geometric Ramsey theory. Given m geometric objects, we
Zilin Jiang (5364491)
core +1 more source
Fractional clique decompositions of dense hypergraphs
Bulletin of the London Mathematical Society, Volume 58, Issue 5, May 2026.Abstract In 2014, Keevash famously proved the existence of (n,q,r)$(n,q,r)$‐Steiner systems as part of settling the Existence Conjecture of Combinatorial Designs (dating from the mid‐1800s). In 2020, Glock, Kühn, and Osthus conjectured a minimum degree generalization: specifically that minimum (r−1)$(r-1)$‐degree at least (1−Cqr−1)n$(1-\frac{C}{q^{r-1}}
Michelle Delcourt +2 more
wiley +1 more source
Exactness and the topology of the space of invariant random equivalence relations
Proceedings of the London Mathematical Society, Volume 132, Issue 5, May 2026.Abstract We characterize exactness of a countable group Γ$\Gamma$ in terms of invariant random equivalence relations (IREs) on Γ$\Gamma$. Specifically, we show that Γ$\Gamma$ is exact if and only if every weak limit of finite IREs is an amenable IRE.
Héctor Jardón‐Sánchez +3 more
wiley +1 more source
Representation theory methods in extremal combinatorics
, 2016 Xiang, QingThe research of this thesis lies in the area of extremal combinatorics. The word "extremal" comes from the kind of problems that are studied in this field.
Plaza, Rafael
core +1 more source
Fortschritte der Physik, Volume 74, Issue 4, April 2026.ABSTRACT In this paper, we continue the development of the Cartan neural networks programme, launched with three previous publications, by focusing on some mathematical foundational aspects that we deem necessary for our next steps forward. The mathematical and conceptual results are diverse and span various mathematical fields, but the inspiring ...
Pietro Fré +4 more
wiley +1 more source
, 2011 Combinatorics is a fundamental mathematical discipline which focuses on the study of discrete objects and their properties. The current workshop brought together researchers from diverse fields such as Extremal and Probabilistic Combinatorics, Discrete ...
core +2 more sources
, 2006 This is the report on the Oberwolfach workshop on Combinatorics, held 1–7 January 2006. Combinatorics is a branch of mathematics studying families of mainly, but not exclusively, finite or countable structures – discrete objects.
Hans Jürgen Prömel, László Lovász
core +3 more sources
Hypergraphs with arbitrarily small codegree Turán density
Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.Abstract The codegree Turán density γ(F)$\gamma (F)$ of a k$k$‐graph F$F$ is the smallest γ∈[0,1)$\gamma \in [0,1)$ such that every k$k$‐graph H$H$ with δk−1(H)⩾(γ+o(1))|V(H)|$\delta _{k-1}(H)\geqslant (\gamma +o(1))\vert V(H)\vert$ contains a copy of F$F$. In this work, we show that for every ε>0$\varepsilon >0$, there is a k$k$‐uniform hypergraph F$F$
Simón Piga, Bjarne Schülke
wiley +1 more source
Universal gap growth for Lyapunov exponents of perturbed matrix products
Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.Abstract We study the quantitative simplicity of the Lyapunov spectrum of d$d$‐dimensional bounded matrix cocycles subjected to additive random perturbations. In dimensions 2 and 3, we establish explicit lower bounds on the gaps between consecutive Lyapunov exponents of the perturbed cocycle, depending only on the scale of the perturbation.
Jason Atnip +3 more
wiley +1 more source
, 2014 Combinatorics is a fundamental mathematical discipline which focuses on the study of discrete objects and their properties. The current workshop brought together researchers from diverse fields such as Extremal and Probabilistic Combinatorics, Discrete ...
core +2 more sources