English
Related papers

Related papers: A uniform version of a theorem by Lindstr\"om

200 papers

We consider vanishing properties of exponential sums of the Liouville function $\lambda$ of the form $$ \lim_{H\to\infty}\limsup_{X\to\infty}\frac{1}{\log X}\sum_{m\leq X}\frac{1}{m}\sup_{\alpha\in C}\bigg|\frac{1}{H}\sum_{h\leq…

Dynamical Systems · Mathematics 2024-08-19 Adam Kanigowski , Mariusz Lemańczyk , Florian Karl Richter , Joni Teräväinen

In this paper, we generalize Minkowski's theorem. This theorem is usually stated for a centrally symmetric convex body and a lattice both included in $\mathbb{R}^n$. In some situations, one may replace the lattice by a more general set for…

Metric Geometry · Mathematics 2016-04-15 Pierre-Antoine Guihéneuf , Emilien Joly

A subset $A$ of $[n] = \{1, \dots, n\}$ is $k$-separated if, when the elements of $[n]$ are considered on a circle, between any two elements of $A$ there are at least $k$ elements of $[n]$ that are not in $A$. A family $\mathcal{A}$ of sets…

Combinatorics · Mathematics 2020-12-08 Peter Borg , Carl Feghali

Let $\mathcal{F}$ be a family of subsets of $[n]=\{1,\ldots,n\}$ and let $L$ be a set of nonnegative integers. The family $\mathcal{F}$ is \emph{$L$-intersecting} if $|F\cap F'|\in L$ for every two distinct members $F,F'\in\mathcal{F}$; and…

Combinatorics · Mathematics 2018-11-29 Yandong Bai , Binlong Li , Jiuqiang Liu , Shenggui Zhang

A subspace of the space, L(n), of traceless complex $n\times n$ matrices can be specified by requiring that the entries at some positions $(i,j)$ be zero. The set, $I$, of these positions is a (zero) pattern and the corresponding subspace…

Representation Theory · Mathematics 2010-06-15 Jinpeng An , Dragomir Z. Djokovic

The uniformity of the decomposition law, for a family F of Lie algebras which includes the exceptional Lie algebras, of the tensor powers ad^n of their adjoint representations ad is now well-known. This paper uses it to embark on the…

Mathematical Physics · Physics 2011-09-01 A. J. Macfarlane , Hendryk Pfeiffer

Let $A$ and $B$ be unital separable simple amenable \CA s which satisfy the Universal Coefficient Theorem. Suppose {that} $A$ and $B$ are $\mathcal Z$-stable and are of rationally tracial rank no more than one. We prove the following:…

Operator Algebras · Mathematics 2012-07-18 Huaxin Lin , Zhuang Niu

Let $m,n\ge 2$ be integers. Denote by $M_n$ the set of $n\times n$ complex matrices. Let $\|\cdot\|_{(p,k)}$ be the $(p,k)$ norm on $M_{mn}$ with $1\leq k\leq mn$ and $2<p<\infty$. We show that a linear map $\phi:M_{mn}\rightarrow M_{mn}$…

Functional Analysis · Mathematics 2023-08-24 Zejun Huang , Nung-Sing Sze , Run Zheng

We prove theorems of the following form: if $A\subseteq {\mathbb R}^2$ is a big set, then there exists a big set $P\subseteq {\mathbb R}$ and a perfect set $Q\subseteq {\mathbb R}$ such that $P\times Q\subseteq A$. We discuss cases where…

General Topology · Mathematics 2007-05-23 Szymon Zeberski

A theorem of Gr\"unbaum, which states that every $m$-polytope is a refinement of an $m$-simplex, implies the following generalization of Tverberg's theorem: if $f$ is a linear function from an $m$-dimensional polytope $P$ to $\mathbb{R}^d$…

Combinatorics · Mathematics 2024-10-04 Pablo Soberón , Shira Zerbib

We introduce a geometric generalization of Hall's marriage theorem. For any family $F = \{X_1, \dots, X_m\}$ of finite sets in $\mathbb{R}^d$, we give conditions under which it is possible to choose a point $x_i\in X_i$ for every $1\leq i…

Combinatorics · Mathematics 2016-02-02 Andreas Holmsen , Leonardo Martinez-Sandoval , Luis Montejano

In 1986, S.Y. Li and H.Xie proved the following theorem:Let k>=2 and let F be a family of functions meromorphic in some domain D, all of whose zeros are of multiplicity at least k. Then F is normal if and only if the family…

Complex Variables · Mathematics 2011-11-04 Shahar Nevo , Xuecheng Pang

O. Einstein (2008) proved Bollob\'as-type theorems on intersecting families of ordered sets of finite sets and subspaces. Unfortunately, we report that the proof of a theorem on ordered sets of subspaces had a mistake. We prove two weaker…

Combinatorics · Mathematics 2019-01-16 Sang-il Oum , Sounggun Wee

We demonstrate the truth of the sunflower conjecture by showing that a family $\mathcal{F}$ of sets each of cardinality at most $m$ includes a $k$-sunflower, if $|\mathcal{F}| > ( c k )^{2m}$ for a constant $c>0$ independent of $m$ and $k$,…

Combinatorics · Mathematics 2026-04-29 Junichiro Fukuyama

In this paper we prove a generalized version of Hall's theorem for hypergraphs. More precisely, let H be a k-uniform k- partite hypergraph with some ordering on parts as V1, V2,..., Vk. such that the subhypergraph generated on union of V1,…

Combinatorics · Mathematics 2016-10-04 Reza Jafarpour-Golzari

Let $\mathcal{F}=\{F_1,F_2, \ldots,F_n\}$ be a family of $n$ sets on a ground set $S$, such as a family of balls in $\mathbb{R}^d$. For every finite measure $\mu$ on $S$, such that the sets of $\mathcal{F}$ are measurable, the classical…

Combinatorics · Mathematics 2014-04-18 Xavier Goaoc , Jiří Matoušek , Pavel Paták , Zuzana Safernová , Martin Tancer

Let f(x_1,x_2,...,x_m) = u_1x_1+u_2 x_2+... + u_mx_m be a linear form with positive integer coefficients, and let N_f(k) = min{|f(A)| : A \subseteq Z and |A|=k}. A minimizing k-set for f is a set A such that |A|=k and |f(A)| = N_f(k). A…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson

A set ${\cal A} \subseteq \Set{1,...,N}$ is of type $B_2$ if all sums $a+b$, with $a\ge b$, $a,b\in {\cal A}$, are distinct. It is well known that the largest such set is of size asymptotic to $N^{1/2}$. For a $B_2$ set ${\cal A}$ of this…

Number Theory · Mathematics 2007-05-23 Mihail N. Kolountzakis

We prove a version of the Cauchy-Davenport theorem for general linear maps. For subsets $A,B$ of the finite field $\mathbb{F}_p$, the classical Cauchy-Davenport theorem gives a lower bound for the size of the sumset $A+B$ in terms of the…

Combinatorics · Mathematics 2015-08-12 Simao Herdade , John Kim , Swastik Kopparty

We prove that given a constant $k \ge 2$ and a large set system $\mathcal{F}$ of sets of size at most $w$, a typical $k$-tuple of sets $(S_1, \cdots, S_k)$ from $\mathcal{F}$ can be ``blown up" in the following sense: for each $1 \le i \le…

Combinatorics · Mathematics 2025-06-03 Ryan Alweiss