中文
相关论文

相关论文: A $0-2$ law for cosine families with $\limsup$ to …

200 篇论文

A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a $t$-intersecting family if $|F\cap G| \geq t$ for any two members $F, G \in \mathcal{F}$ and for some positive integer $t$. If $t=1$, then we call the family $\mathcal{F}$…

组合数学 · 数学 2022-11-23 Jagannath Bhanja , Sayan Goswami

Let A be a C*-algebra with real rank zero which has the stable weak cancellation property. Let I be an ideal of A such that I is stable and satisfies the corona factorization property. We prove that 0->I->A->A/I->0 is a full extension if…

算子代数 · 数学 2021-09-20 Søren Eilers , Gunnar Restorff , Efren Ruiz

For any fixed positive integer $k$, let $\alpha_{k}$ denote the smallest $\alpha \in (0,1)$ such that the random graph sequence $\left\{G\left(n, n^{-\alpha}\right)\right\}$ does not satisfy the zero-one law for the set $\mathcal{E}_{k}$ of…

概率论 · 数学 2020-11-03 Moumanti Podder , Maksim Zhukovskii

Let $n\geq\nu$, let $T$ be an $n$-vertex tree with bipartition class sizes $t_1\geq t_2$, and let $S$ be a $\nu$-vertex tree with bipartition class sizes $\tau_1\geq\tau_2$. Using four natural constructions, we show that the Ramsey number…

组合数学 · 数学 2025-11-20 Jun Yan

We give upper bounds for the number of rational elliptic surfaces in some families having positive rank, obtaining in particular that these form a subset of density zero. This confirms Cowan's conjecture (arXiv:2009.08622v2) in the case…

数论 · 数学 2022-03-30 Francesco Battistoni , Sandro Bettin , Christophe Delaunay

A finite family $\mathrsfs{F}$ of subsets of a finite set $X$ is union-closed whenever $f,g\in\mathrsfs{F}$ implies $f\cup g\in\mathrsfs{F}$. These families are well known because of Frankl's conjecture. In this paper we developed further…

组合数学 · 数学 2012-10-16 Emanuele Rodaro

Motivated by algebraic quantum field theory and our previous work we study properties of inductive systems of \ $C^*$-algebras over arbitrary partially ordered sets. A partially ordered set can be represented as the union of the family of…

算子代数 · 数学 2019-03-27 Renat Gumerov , Ekaterina Lipacheva , Tamara Grigoryan

We prove that there exists a constant $c_0$ such that for any $t \in \mathbb{N}$ and any $n\geq c_0 t$, if $A \subset S_n$ is a $t$-intersecting family of permutations then$|A|\leq (n-t)!$. Furthermore, if $|A|\ge 0.75(n-t)!$ then there…

组合数学 · 数学 2023-07-18 Nathan Keller , Noam Lifshitz , Dor Minzer , Ohad Sheinfeld

We extend the classical van der Corput inequality to the real line. As a consequence, we obtain a simple proof of the Wiener-Wintner theorem for the $\mathbb{R}$-action which assert that for any family of maps $(T_t)_{t \in \mathbb{R}}$…

动力系统 · 数学 2021-07-20 el Houcein el Abdalaoui

We prove new upper bounds for the length of laws that hold for all groups of size at most $n$ -- improving on previous results of Bou-Rabee and Kassabov-Matucci. The methods make use of the classification of finite simple groups. Stronger…

群论 · 数学 2015-09-08 Andreas Thom

We study the low-lying zeros of various interesting families of elliptic curve L-functions. One application is an upper bound on the average analytic rank of the family of all elliptic curves. The upper bound obtained is less than two,…

数论 · 数学 2020-08-17 Matthew P. Young

For a given number of $k$-sets, how should we choose them so as to minimize the union-closed family that they generate? Our main aim in this paper is to show that, if $\mathcal{A}$ is a family of $k$-sets of size $\binom{t}{k}$, and $t$ is…

组合数学 · 数学 2023-09-06 Žarko Ranđelović

Let $G$ be an additive finite abelian group, and let $\mathrm{disc}(G)$ denote the smallest positive integer $t$ with the property that every sequence $S$ over $G$ with length $|S|\geq t $ contains two nonempty zero-sum subsequences of…

组合数学 · 数学 2025-10-17 Wanzhen Hui , Xue Li

A classification theorem is obtained for a class of unital simple separable amenable Z-stable C*-algebras which exhausts all possible values of the Elliott invariant for unital stably finite simple separable amenable Z-stable C*-algebras.…

算子代数 · 数学 2021-05-05 Guihua Gong , Huaxin Lin , Z. Niu

Let $\alpha \in (1/2,1)$ be fixed. We prove that $$ \max_{0 \leq t \leq T} |\zeta(\alpha+it)| \geq \exp\left(\frac{c_\alpha (\log T)^{1-\alpha}}{(\log \log T)^\alpha}\right) $$ for all sufficiently large $T$, where we can choose $c_\alpha =…

数论 · 数学 2015-09-01 Christoph Aistleitner

The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result of Vereshchagin saying that $\limsup_n C(x|n)$ equals $C^{0'}(x)$. Then we use the…

We show that there is some absolute constant $c>0$, such that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}$, if \mbox{$|\mathcal{F}| \geq (\frac{1}{2}-c)2^n$}, then there is some element $i \in [n]$ that appears in at least…

组合数学 · 数学 2017-08-07 Ilan Karpas

For a nonnegative integer $t$, let $c_t$ be the asymptotic density of natural numbers $n$ for which $s(n + t) \geq s(n)$, where $s(n)$ denotes the sum of digits of $n$ in base $2$. We prove that $c_t > 1/2$ for $t$ in a set of asymptotic…

组合数学 · 数学 2016-05-03 Michael Drmota , Manuel Kauers , Lukas Spiegelhofer

A family of subsets of a $t$-set is a \emph{$d$-cover-free family} or $d$-CFF if no subset in the family is contained in the union of any $d$ other subsets. Let $t(d, n)$ denote the minimum $t$ for which there exists a $d$-CFF on a $t$-set…

组合数学 · 数学 2026-05-14 Prangya Parida , Lucia Moura

In this paper we prove that every set $A\subset\mathbb{Z}$ satisfying the inequality $\sum_{x}\min(1_A*1_A(x),t)\le(2+\delta)t|A|$ for $t$ and $\delta$ in suitable ranges, then $A$ must be very close to an arithmetic progression. We use…

组合数学 · 数学 2015-06-02 Przemysław Mazur