Results 121 to 130 of about 169,932 (295)
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract In 1935, Philip Hall published what is often referred to as ‘Hall's marriage theorem’ in a short paper (P. Hall, J. Lond. Math. Soc. (1) 10 (1935), no. 1, 26–30.) This paper has been very influential. I state the theorem and outline Hall's proof, together with some equivalent (or stronger) earlier results, and proceed to discuss some the many ...
Peter J. Cameron
wiley +1 more source
Journal of the London Mathematical Society, Volume 113, Issue 1, January 2026.Abstract Sunflowers, or Δ$\Delta$‐systems, are a fundamental concept in combinatorics introduced by Erdős and Rado in their paper: [J. London Math. Soc. (1) 35 (1960), 85–90]. A sunflower is a collection of sets where all pairs have the same intersection.
Anup Rao
wiley +1 more source
BarekengThe rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi +3 more
doaj +1 more source
Analytic combinatorics for a certain well-ordered class of iterated exponential terms [PDF]
, 2005 Andreas Weiermann
openalex +1 more source
On a rigidity property for quadratic gauss sums
Mathematika, Volume 72, Issue 1, January 2026.Abstract Let N$N$ be a large prime and let c>1/4$c > 1/4$. We prove that if f$f$ is a ±1$\pm 1$‐valued multiplicative function, such that the exponential sums Sf(a):=∑1⩽n
Alexander P. Mangerel
wiley +1 more source
Carries, group theory, and additive combinatorics [PDF]
, 2013 Persi Diaconis +2 more
openalex +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
Mathematika, Volume 72, Issue 1, January 2026.Abstract In the “Covering” pursuit game on a graph, a robber and a set of cops play alternately, with the cops each moving to an adjacent vertex (or not moving) and the robber moving to a vertex at distance at most 2 from his current vertex. The aim of the cops is to ensure that, after every one of their turns, there is a cop at the same vertex as the ...
Benjamin Gillott
wiley +1 more source
Combinatorics of the Toric Hilbert Scheme [PDF]
, 2002 Diane Maclagan, Rekha R. Thomas
openalex +1 more source
Combinatorics on number walls and the P(t)$P(t)$‐adic Littlewood conjecture
Mathematika, Volume 72, Issue 1, January 2026.Abstract In 2004, de Mathan and Teulié stated the p$p$‐adic Littlewood conjecture (p$p$‐LC) in analogy with the classical Littlewood conjecture. Let Fq$\mathbb {F}_q$ be a finite field P(t)$P(t)$ be an irreducible polynomial with coefficients in Fq$\mathbb {F}_q$. This paper deals with the analogue of p$p$‐LC over the ring of formal Laurent series over
Steven Robertson
wiley +1 more source