English
Related papers

Related papers: Sperner systems with restricted differences

200 papers

Let $q=p^\alpha$ be a fixed prime power, $k\geq 2$ be an integer. We give a new upper bound for the size of $k$-wise $q$-modular $L$-avoiding $L$-intersecting set systems, where $L$ is any proper subset of $\{0, \ldots , q-1\}$. Our proof…

Combinatorics · Mathematics 2025-01-07 Gábor Hegedüs

A collection of families $(\mathcal{F}_{1}, \mathcal{F}_{2} , \cdots , \mathcal{F}_{k}) \in \mathcal{P}([n])^k$ is cross-Sperner if there is no pair $i \not= j$ for which some $F_i \in \mathcal{F}_i$ is comparable to some $F_j \in…

Combinatorics · Mathematics 2023-02-07 Natalie Behague , Akina Kuperus , Natasha Morrison , Ashna Wright

For a set $L$ of positive integers, a set system $\mathcal{F} \subseteq 2^{[n]}$ is said to be $L$-close Sperner, if for any pair $F,G$ of distinct sets in $\mathcal{F}$ the skew distance $sd(F,G)=\min\{|F\setminus G|,|G\setminus F|\}$…

Combinatorics · Mathematics 2020-04-09 Daniel Nagy , Balazs Patkos

In this paper, we derive a tight upper bound for the size of an intersecting $k$-Sperner family of subspaces of the $n$-dimensional vector space $\mathbb{F}_{q}^{n}$ over finite field $\mathbb{F}_{q}$ which gives a $q$-analogue of the…

Combinatorics · Mathematics 2024-05-01 Jiuqiang Liu , Guihai Yu , Lihua Feng , Yongtao Li

We establish a sub-convexity estimate for Rankin-Selberg $L$-functions in the combined level aspect, using the circle method. If $p$ and $q$ are distinct prime numbers, $f$ and $g$ are non-exceptional newforms (modular or Maass) for the…

Number Theory · Mathematics 2018-07-31 Chandrasekhar Raju

A family $\mbox{$\cal F$}=\{F_1,\ldots,F_m\}$ of subsets of $[n]$ is said to be ordered, if there exists an $1\leq r\leq m$ index such that $n\in F_i$ for each $1\leq i\leq r$, $n\notin F_i$ for each $i>r$ and $|F_i|\leq |F_j|$ for each…

Combinatorics · Mathematics 2024-11-08 Gábor Hegedüs

We give examples of sequences defined by smooth functions of intermediate growth, and we study the Furstenberg systems that model their statistical behavior. In particular, we show that the systems are Bernoulli. We do so by studying…

Dynamical Systems · Mathematics 2025-10-15 Andreu Ferré Moragues , Andreas Koutsogiannis

In the first part of this paper, we prove a theorem which is the $q$-analogue of a generalized modular Ray-Chaudhuri-Wilson Theorem shown in [Alon, Babai, Suzuki, J. Combin. Theory Series A, 1991]. It is also a generalization of the main…

Combinatorics · Mathematics 2020-06-05 Rogers Mathew , Tapas Kumar Mishra , Ritabrata Ray , Shashank Srivastava

Let $p\geq 3$ be a prime and $n\geq 1$ be an integer. Let $K\subseteq {\mathbb{F}_p}$ denote a fixed subset with $0\in K$. Let $A\subseteq ({\mathbb{F}_p})^n$ be an arbitrary subset such that $$\{…

Number Theory · Mathematics 2018-12-06 Gábor Hegedűs

De Loera, O'Neill and Wilburne introduced a general model for random numerical semigroups in which each positive integer is chosen independently with some probability p to be a generator, and proved upper and lower bounds on the expected…

Commutative Algebra · Mathematics 2025-07-23 Tristram Bogart , Santiago Morales

One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…

Commutative Algebra · Mathematics 2017-11-13 Richard Gustavson , Omar León Sánchez

As a homomorphic image of the hyperalgebra $U_{q,R}(m|n)$ associated with the quantum linear supergroup $U_\upsilon(\mathfrak{gl}_{m|n})$, we first give a presentation for the $q$-Schur superalgebra $S_{q,R}(m|n,r)$ over a commutative ring…

Representation Theory · Mathematics 2018-05-29 Jie Du , Yanan Lin , Zhongguo Zhou

Let $p$ be a fixed odd prime. Let $E$ be an elliptic curve defined over a number field $F$ with good supersingular reduction at all primes above $p$. We study both the classical and plus/minus Selmer groups over the cyclotomic…

Number Theory · Mathematics 2021-03-11 Antonio Lei , R. Sujatha

An $(n,k)$-Sperner partition system is a collection of partitions of some $n$-set, each into $k$ nonempty classes, such that no class of any partition is a subset of a class of any other. The maximum number of partitions in an…

Combinatorics · Mathematics 2020-11-13 Yanxun Chang , Charles J. Colbourn , Adam Gowty , Daniel Horsley , Junling Zhou

A \textsl{Sperner $k$-partition system} on a set $X$ is a set of partitions of $X$ into $k$ classes such that the classes of the partitions form a Sperner set system (so no class from a partition is a subset of a class from another…

Combinatorics · Mathematics 2012-01-23 P. C. Li , Karen Meagher

In 1986 Lovasz, Spencer, and Vesztergombi proved a lower bound for the hereditary a discrepancy of a set system F in terms of determinants of square submatrices of the incidence matrix of F. As shown by an example of Hoffman, this bound can…

Combinatorics · Mathematics 2011-07-07 Jiri Matousek

The paper is devoted to some applications of Stepanov method. In the first part of the paper we obtain the estimate of the cardinality of the set, which is obtained as an intersection of additive shifts of some different subgroups of F^*_p.…

Number Theory · Mathematics 2015-05-07 Ilya D. Shkredov , Elena V. Solodkova , Ilya V. Vyugin

The Frobenius companion matrix, and more recently the Fiedler companion matrices, have been used to provide lower and upper bounds on the modulus of any root of a polynomial $p(x)$. In this paper we explore new bounds obtained from taking…

Rings and Algebras · Mathematics 2017-11-08 Kevin N. Vander Meulen , Trevor Vanderwoerd

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

Number Theory · Mathematics 2023-01-10 Arnaud Bodin , Pierre Dèbes , Salah Najib

The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Groebner bases methods. In this paper, we consider polynomial systems that are…

Cryptography and Security · Computer Science 2023-02-06 Alessio Caminata , Michela Ceria , Elisa Gorla
‹ Prev 1 2 3 10 Next ›