English
Related papers

Related papers: How close can we come to a parity function when th…

200 papers

Consider a monic polynomial of degree $n$ whose subleading coefficients are independent, identically distributed, nondegenerate random variables having zero mean, unit variance, and finite moments of all orders, and let $m \geq 0$ be a…

Probability · Mathematics 2024-09-12 Matthew C. King , Ashvin Swaminathan

We consider a setting where we have a ground set $M$ together with real-valued set functions $f_1, \dots, f_n$, and the goal is to partition $M$ into two sets $S_1,S_2$ such that $|f_i(S_1) - f_i(S_2)|$ is small for every $i$. Many results…

Combinatorics · Mathematics 2025-10-01 Alexandros Hollender , Pasin Manurangsi , Raghu Meka , Warut Suksompong

For graphs F and G an F-matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F. The number of F-matchings in G is denoted by s(F,G). We show that for every fixed positive integer m and every fixed tree F, the…

Combinatorics · Mathematics 2010-06-29 Noga Alon , Simi Haber , Michael Krivelevich

An arbitrary homomorphism between groups is nonincreasing for stable commutator length, and there are infinitely many (injective) homomorphisms between free groups which strictly decrease the stable commutator length of some elements.…

Group Theory · Mathematics 2015-03-17 Danny Calegari , Alden Walker

Let $A$ be a $C^*$-algebra and $E\colon A \to A$ a conditional expectation. The Kadison-Schwarz inequality for completely positive maps, $$E(x)^*E(x) \leq E(x^* x),$$ implies that $$ \|E(x)\|^2 \leq \|E(x^* x)\|.$$ In this note we show that…

Operator Algebras · Mathematics 2017-06-09 Robert Pluta , Bernard Russo

A graphon is said to have the $H$-property if a random undirected graph $G_n$ on $n$ nodes sampled from it has a node-wise disjoint cycle cover almost surely as $n\to\infty$. It has been shown in the earlier work that the $H$-property obeys…

Probability · Mathematics 2026-04-08 Wanting Gao , Hong Hu , Xudong Chen

We show that the density of quadratic forms in $n$ variables over $\mathbb Z_p$ that are isotropic is a rational function of $p$, where the rational function is independent of $p$, and we determine this rational function explicitly. When…

Number Theory · Mathematics 2015-02-23 M. Bhargava , J. E. Cremona , T. A. Fisher , N. G. Jones , J. P. Keating

Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, showing that it is asymptotically…

Combinatorics · Mathematics 2026-05-01 Ben Green , Mehtaab Sawhney

Suppose that $X$ and $Y$ are surfaces of finite topological type, where $X$ has genus $g\geq 6$ and $Y$ has genus at most $2g-1$; in addition, suppose that $Y$ is not closed if it has genus $2g-1$. Our main result asserts that every…

Geometric Topology · Mathematics 2014-11-11 Javier Aramayona , Juan Souto

For a finite group $G$, let $d(G)$ denote the probability that a randomly chosen pair of elements of $G$ commute. We prove that if $d(G)>1/s$ for some integer $s>1$ and $G$ splits over an abelian normal nontrivial subgroup $N$, then $G$ has…

Group Theory · Mathematics 2013-11-01 Paul Lescot , Hung Ngoc Nguyen , Yong Yang

Apportionment is the act of distributing the seats of a legislature among political parties (or states) in proportion to their vote shares (or populations). A famous impossibility by Balinski and Young (2001) shows that no apportionment…

Computer Science and Game Theory · Computer Science 2024-05-07 José Correa , Paul Gölz , Ulrike Schmidt-Kraepelin , Jamie Tucker-Foltz , Victor Verdugo

Let $A$ be drawn uniformly at random from the set of all $n\times n$ symmetric matrices with entries in $\{-1,1\}$. We show that \[ \mathbb{P}( \det(A) = 0 ) \leq e^{-cn},\] where $c>0$ is an absolute constant, thereby resolving a…

Probability · Mathematics 2021-06-09 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

In this article, we classify all symmetric generalized numerical semigroups in $\mathbb{N}^d$ of embedding dimension $2d+1$. Consequently, we show that in this case the property of being symmetric is equivalent to have a unique maximal gap…

Commutative Algebra · Mathematics 2025-07-15 Om Prakash Bhardwaj , Carmelo Cisto

Our work studies the fair allocation of indivisible items to a set of agents, and falls within the scope of establishing improved approximation guarantees. It is well known by now that the classic solution concepts in fair division, such as…

Computer Science and Game Theory · Computer Science 2023-08-10 Evangelos Markakis , Christodoulos Santorinaios

We study the existence of homomorphisms between Out(F_n) and Out(F_m) for n > 5 and m < n(n-1)/2, and conclude that if m is not equal to n then each such homomorphism factors through the finite group of order 2. In particular this provides…

Group Theory · Mathematics 2015-06-08 Dawid Kielak

We present a novel family of nonparametric omnibus tests of the hypothesis that two unknown but estimable functions are equal in distribution when applied to the observed data structure. We developed these tests, which represent a…

Statistics Theory · Mathematics 2017-06-15 Alexander R. Luedtke , Marco Carone , Mark J. van der Laan

Let $H$ be an infinite dimensional separable Hilbert space, $B(H)$ the $C^*$-algebra of all bounded linear operators on $H,$ $U(B(H))$ the unitary group of $B(H)$ and ${\cal K}\subset B(H)$ the ideal of compact operators. Let $G$ be a…

Operator Algebras · Mathematics 2025-02-26 Huaxin Lin

A topological space $Y$ is said to have (AEEP) if the following condition is fulfilled. Whenever $(X,\mathfrak{M})$ is a measurable space and $f, g: X \to Y$ are two measurable functions, then the set $\Delta(f,g) = \{x \in X:\ f(x) =…

General Topology · Mathematics 2014-11-03 Piotr Niemiec

Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs $G$ and $H$ are called homomorphism indistinguishable over a graph class $\mathcal{F}$ if for each $F \in \mathcal{F}$,…

Quantum Physics · Physics 2026-04-21 Tim Seppelt , Gian Luca Spitzer

Consider a family $\mathcal F$ of $C_{2r+1}$-free graphs, where $r\geq 2$. Suppose that each graph in $\mathcal F$ has minimum degree linear in its number of vertices. Thomassen showed that such a family has bounded chromatic number, or,…

Combinatorics · Mathematics 2022-06-16 Maya Sankar