中文
相关论文

相关论文: The Asymptotic Bound of the Lubell Function for Di…

200 篇论文

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

组合数学 · 数学 2025-09-03 Noga Alon , Huy Tuan Pham

In this paper, we obtain the upper bounds for the Hausdorff measures of nodal sets of eigenfunctions with the Robin boundary conditions, i.e., \begin{equation*} {\left\{\begin{array}{l} \triangle u+\lambda u=0,\quad in\quad \Omega,\\…

偏微分方程分析 · 数学 2018-01-09 Fang Liu , Long Tian , Xiaoping Yang

An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms \[ \begin{cases} F = c_{1}x_1^3 + c_{2}x_2^3 + \cdots + c_{n}x_n^3 = 0, \\ G = d_{1}x_1^3 + d_{2}x_2^3 + \cdots + d_{n}x_n^3 =…

数论 · 数学 2026-02-24 Yixiu Xiao , Hongze Li

A family ${\cal F}$ of graphs is asymptotically $\chi$-bounded with bounding function $f$ if almost every graph $G$ in the family satisfies $\chi(G) \le f(\omega(G))$. A graph is $H$-free if it does not contain $H$ as an induced subgraph.…

组合数学 · 数学 2025-06-03 Bruce Reed , Yelena Yuditsky

For a nonempty polyhedral set $P\subset \mathbb R^d$, let $\mathcal F(P)$ denote the set of faces of $P$, and let $N(P,F)$ be the normal cone of $P$ at the nonempty face $F\in\mathcal F(P)$. We prove that the function $\sum_{F\in\mathcal…

度量几何 · 数学 2018-02-14 Daniel Hug , Zakhar Kabluchko

Erd\H{o}s proved that $\mathcal{F}(A) := \sum_{a \in A}\frac{1}{a\log a}$ converges for any primitive set of integers $A$ and later conjectured this sum is maximized when $A$ is the set of primes. Banks and Martin further conjectured that…

Let $A$ be a nonempty subset of finite abelian group $G$ of order $n$. For an integer $h \geq 2$, the restricted $h$-fold sumset $h^\wedge A$ is the set of all sums of $h$ distinct elements of $A$. It is known that if $G$ is a group of…

数论 · 数学 2026-05-26 Vivekanand Goswami , Raj Kumar Mistri

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

数据结构与算法 · 计算机科学 2015-04-08 Ishay Haviv , Oded Regev

We asymptotically determine the size of the largest family F of subsets of {1,...,n} not containing a given poset P if the Hasse diagram of P is a tree. This is a qualitative generalization of several known results including Sperner's…

组合数学 · 数学 2009-11-21 Boris Bukh

Let $G$ be a graph and $\mathcal{F}$ a family of graphs. Define $\alpha_{\mathcal{F}}(G)$ as the maximum order of any induced subgraph of $G$ that belongs to the family $\mathcal{F}$. For the family $\mathcal{F}$ of graphs with…

组合数学 · 数学 2026-05-12 Yair Caro , Randy Davila , Michael A. Henning , Ryan Pepper

In this paper we introduce a problem that bridges forbidden subposet and forbidden subconfiguration problems. The sets $F_1,F_2, \dots,F_{|P|}$ form a copy of a poset $P$, if there exists a bijection $i:P\rightarrow \{F_1,F_2,…

组合数学 · 数学 2017-06-06 Dániel Gerbner , Balázs Patkós , Máté Vizer

Given any non-polynomial $G$-function $F(z)=\sum\_{k=0}^\infty A\_k z^k$ of radius of convergence $R$, we consider the $G$-functions $F\_n^{[s]}(z)=\sum\_{k=0}^\infty \frac{A\_k}{(k+n)^s}z^k$ for any integers $s\geq 0$ and $n\geq 1$. For…

数论 · 数学 2017-02-01 Stéphane Fischler , Tanguy Rivoal

Let k be a positive integer and let f be a map from V(G) to the set of all subsets of {1,2,3,...,k}. The function f is called a k-rainbow dominating function of G provided that whenever u is a vertex of G such that f(u) is the empty set,…

组合数学 · 数学 2013-03-14 Tadeja Kraner Sumenjak , Douglas F. Rall , Aleksandra Tepeh

We let $\mathcal{F}$ be a finite family of sets closed under taking unions and $\emptyset \not \in \mathcal{F}$, and call an element abundant if it belongs to more than half of the sets of $\mathcal{F}$. In this notation, the classical…

组合数学 · 数学 2023-05-31 Adam Kabela , Michal Polák , Jakub Teska

For a family of continuous functions $f_1,f_2,\dots \colon I \to \mathbb{R}$ ($I$ is a fixed interval) with $f_1\le f_2\le \dots$ define a set $$ I_f:=\big\{x \in I \colon \lim_{n \to \infty} f_n(x)=+\infty\big\}.$$ We study the properties…

经典分析与常微分方程 · 数学 2024-03-29 Karol Gryszka , Paweł Pasteczka

We fully describe the horofunction boundary $\partial_h L_2$ with the word metric associated with the generating set $\{t,at\}$ (i.e the metric arising in the Diestel-Leader graph $\text{DL}(2,2)$). The visual boundary $\partial_\infty L_2$…

群论 · 数学 2016-01-20 Keith Jones , Gregory A. Kelsey

Let $f(n)$ denote a multiplicative function with range $\{-1,0,1\}$, and let $F(x) = \sum_{n\leq x} f(n)$. Then $F(x)/\sqrt{x} = a\sqrt{x} + b + E(x)$, where $a$ and $b$ are constants and $E(x)$ is an error term that either tends to $0$ in…

数论 · 数学 2021-12-13 Greg Martin , Michael J. Mossinghoff , Timothy S. Trudgian

For an open set $V\subset\mathbb{C}^n$, denote by $\mathscr{M}_{\alpha}(V)$ the family of $\alpha$-analytic functions that obey a boundary maximum modulus principle. We prove that, on a bounded domain $\Omega\subset \mathbb{C}^n$, with…

复变函数 · 数学 2018-09-05 Abtin Daghighi , Frank Wikström

Understanding the query complexity for testing linear-invariant properties has been a central open problem in the study of algebraic property testing. Triangle-freeness in Boolean functions is a simple property whose testing complexity is…

计算复杂性 · 计算机科学 2013-08-08 Hu Fu , Robert Kleinberg

Let $G$ be any group and $A$ be an arbitrary subset of $G$ (not necessarily symmetric and not necessarily containing the identity). The $h$-fold product set of $A$ is defined as $$A^{h} :=\lbrace a_{1}.a_{2}...a_{h} : a_{1},\ldots,a_n \in A…

数论 · 数学 2019-02-18 Arindam Biswas , Wolfgang Alexander Moens
‹ 上一页 1 8 9 10 下一页 ›