中文
相关论文

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

200 篇论文

A well-known problem in the theory of polynomials over finite fields is the characterization of minimal value set polynomials (MVSPs) over the finite field $\mathbb{F}_q$, where $q = p^n$. These are the nonconstant polynomials $F \in…

数论 · 数学 2025-08-12 Herivelto Borges , Lucas Reis

This paper studies the hazard-free formula complexity of Boolean functions. Our first result shows that unate functions are the only Boolean functions for which the monotone formula complexity of the hazard-derivative equals the hazard-free…

计算复杂性 · 计算机科学 2025-06-17 Leah London Arazi , Amir Shpilka

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. Suppose the characteristic of $\mathbb{F}_q$ is not $2$ or $3$. In this paper, we prove an $\mathbb{F}_q[t]$-analogue of results…

数论 · 数学 2015-10-26 Wentang Kuo , Shuntaro Yamagishi

An unlabeled poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Let $p_n$ denote the number of (2+2)-free posets of size $n$. In a recent paper,…

组合数学 · 数学 2010-04-20 Sergey Kitaev , Jeffrey Remmel

Recently, Croot, Lev, and Pach (Ann. of Math., 185:331--337, 2017.) and Ellenberg and Gijswijt (Ann. of Math., 185:339--443, 2017.) developed a new polynomial method and used it to prove upper bounds for three-term arithmetic progression…

组合数学 · 数学 2019-10-01 Gennian Ge , Chong Shangguan

Using Stickelberger's theorem on Gauss sums, we show that if $F$ is a planar function on a finite field $\mathbb{F}_q$, then for all non-zero functions $G : \mathbb{F}_q \to \mathbb{F}_q$, we have \begin{equation*} d_{\mathsf{alg}}(G \circ…

组合数学 · 数学 2025-10-30 Christof Beierle , Tim Beyne

The Density Conjecture of Katz and Sarnak associates a classical compact group to each reasonable family of $L$-functions. Under the assumption of the Generalized Riemann Hypothesis, Rubinstein computed the $n$-level density of low-lying…

数论 · 数学 2008-07-01 Peng Gao

For a given finite poset $P$, $La(n,P)$ denotes the largest size of a family $\mathcal{F}$ of subsets of $[n]$ not containing $P$ as a weak subposet. We exactly determine $La(n,P)$ for infinitely many $P$ posets. These posets are built from…

组合数学 · 数学 2012-04-25 Péter Burcsi , Dániel T. Nagy

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

计算复杂性 · 计算机科学 2015-08-12 Parikshit Gopalan , Noam Nisan , Rocco A. Servedio , Kunal Talwar , Avi Wigderson

In this paper, we compute an upper bound for the Dehn function of a finitely presented metabelian group. In addition, we prove that the same upper bound works for the relative Dehn function of a finitely generated metabelian group. We also…

群论 · 数学 2022-10-27 Wenhao Wang

While Dehn functions, D(n), of finitely presented groups are very well studied in the literature, mean Dehn functions are much less considered. M. Gromov introduced the notion of mean Dehn function of a group, $D_{mean}(n)$, suggesting that…

群论 · 数学 2007-05-23 O. Bogopolski , E. Ventura

We define the notion of {\it Dwork family of logarithmic $F$-crystals}, a typical example of which is the family of Gauss hypergeometricdifferential systems, viewed as parametrized by their exponents of algebraic monodromy. The $p$-adic…

数论 · 数学 2007-05-23 Francesco Baldassarri , Maurizio Cailotto

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

计算复杂性 · 计算机科学 2015-02-05 Chia-Jung Lee , Satya V. Lokam , Shi-Chun Tsai , Ming-Chuan Yang

A family $\mathcal{F}\subset \binom{[n]}{k}$ is called an intersecting family if $F\cap F'\neq \emptyset$ for all $F,F'\in \mathcal{F}$. If $\cap \mathcal{F}\neq \emptyset$ then $\mathcal{F}$ is called a star. The diversity of an…

组合数学 · 数学 2023-04-24 Peter Frankl , Jian Wang

For $S\subseteq \mathbb{F}^n$, consider the linear space of restrictions of degree-$d$ polynomials to $S$. The Hilbert function of $S$, denoted $\mathrm{h}_S(d,\mathbb{F})$, is the dimension of this space. We obtain a tight lower bound on…

计算复杂性 · 计算机科学 2024-05-17 Alexander Golovnev , Zeyu Guo , Pooya Hatami , Satyajeet Nagargoje , Chao Yan

Let $n$ be any positive integer and $\mathcal{F}$ be a family of subsets of $[n]$. A family $\mathcal{F}'$ is said to be $D$-\emph{secting} for $\mathcal{F}$ if for every $A \in \mathcal{F}$, there exists a subset $A' \in \mathcal{F}'$ such…

A family $f_t(z)$ of polynomials over a number field $K$ will be called \emph{weighted homogeneous} if and only if $f_t(z)=F(z^e, t)$ for some binary homogeneous form $F(X, Y)$ and some integer $e\geq 2$. For example, the family $z^d+t$ is…

数论 · 数学 2017-06-14 Patrick Ingram

The purpose of this paper is to investigate the asymptotic behavior of automorphism groups of function fields when genus tends to infinity. Motivated by applications in coding and cryptography, we consider the maximum size of abelian…

数论 · 数学 2017-07-25 Liming Ma , Chaoping Xing

A family of subsets of $\{1,2,\ldots,n\}$ is said to be {\em antipodal} if it is closed under taking complements. We prove a best-possible isoperimetric inequality for antipodal families of subsets of $\{1,2,\ldots,n\}$. Our inequality…

组合数学 · 数学 2017-11-15 David Ellis , Imre Leader

In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…

数论 · 数学 2024-08-27 Jerzy Grunwald , Grzegorz Serafin