English
Related papers

Related papers: A Note on the Cross-Correlation of Costas Permutat…

200 papers

Let $n$, $k$ and $t$ be positive integers, and let $\mathcal{F}$ be a collection of $k$-subsets of $[n]=\{1,2,\dots,n\}$. The $t$-covering number $\tau_t(\mathcal{F})$ of $\mathcal{F}$ is defined as the minimum size of a set $T$ such that…

Combinatorics · Mathematics 2026-05-20 Yu Zhu , Benjian Lv , Kaishun Wang

Given integers $r\geq 2$ and $n,t\geq 1$ we call families $\mathcal{F}_1,\dots,\mathcal{F}_r\subseteq\mathscr{P}([n])$ $r$-cross $t$-intersecting if for all $F_i\in\mathcal{F}_i$, $i\in[r]$, we have $\vert\bigcap_{i\in[r]}F_i\vert\geq t$.…

Combinatorics · Mathematics 2020-12-01 Pranshu Gupta , Yannick Mogge , Simón Piga , Bjarne Schülke

In this paper we study a question related to the classical Erd\H{o}s-Ko-Rado theorem, which states that any family of $k$-element subsets of the set $[n] = \{1,\ldots,n\}$ in which any two sets intersect, has cardinality at most…

Combinatorics · Mathematics 2017-11-30 Peter Frankl , Andrey Kupavskii

Let $\omega(\mathcal{F})=\sum_{\{A,B\}\subset\mathcal{F}}|A\cap B|$ and $\omega(\mathcal{A},\mathcal{B})=\sum_{(A,B)\in \mathcal{A}\times \mathcal{B}}|A\cap B|$. A family $\mathcal{F}$ is intersecting if $F_1\cap F_2\neq \emptyset$ for any…

Combinatorics · Mathematics 2024-02-27 Sumin Huang

We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…

Disordered Systems and Neural Networks · Physics 2020-07-08 S. S. Manna , Robert M. Ziff

In this article I study the variation of Selmer groups in families of modular Galois representations that are congruent modulo a fixed prime $p \geq 5$. Motivated by analogies with Goldfeld's conjecture on ranks in quadratic twist families…

Number Theory · Mathematics 2026-04-29 Anwesh Ray

We study the relationship between two measures of pseudorandomness for families of binary sequences: family complexity and cross-correlation measure introduced by Ahlswede et al.\ in 2003 and recently by Gyarmati et al., respectively. More…

Number Theory · Mathematics 2014-08-22 Arne Winterhof , Oğuz Yayla

We consider isoperimetric sets, i.e., sets with minimal vertex boundary for a prescribed volume, of the infinite cluster of supercritical site percolation on the triangular lattice. Let $p$ be the percolation parameter and let $p_c$ be the…

Probability · Mathematics 2023-12-19 Chang-Long Yao

The cross-correlation problem is a classic problem in sequence design. In this paper we compute the cross-correlation distribution of the Niho-type decimation $d=3(p^m-1)+1$ over $\mathrm{GF}(p^{2m})$ for any prime $p \ge 5$. Previously…

Information Theory · Computer Science 2023-09-14 Maosheng Xiong , Haode Yan

Separating hash families are useful combinatorial structures which are generalizations of many well-studied objects in combinatorics, cryptography and coding theory. In this paper, using tools from graph theory and additive number theory,…

Discrete Mathematics · Computer Science 2016-10-26 Chong Shangguan , Gennian Ge

Unifying the generalized Marshall-Olkin (GMO) and Poisson-G (P-G) a new family of distribution is proposed. Density and the survival function are expressed as infinite mixtures of P-G family. The quantile function, asymptotes, shapes,…

Statistics Theory · Mathematics 2020-06-11 Laba Handique , Farrukh Jamal , Subrata Chakraborty

Let $p\geq 5$ be a prime number. In this paper, we construct Galois representations associated with modular forms for which the dimension of the $p$-torsion in the Bloch-Kato Selmer group can be made arbitrarily large. Our result extends…

Number Theory · Mathematics 2025-05-16 Eknath Ghate , Anwesh Ray

The p-parity conjecture for twists of elliptic curves relates multiplicities of Artin representations in p-infinity Selmer groups to root numbers. In this paper we prove this conjecture for a class of such twists. For example, if E/Q is…

Number Theory · Mathematics 2013-09-23 Tim Dokchitser , Vladimir Dokchitser

We consider a problem of approximating the size of the largest clique in a graph, with a monotone circuit. Concretely, we focus on distinguishing a random Erd\H{o}s-Renyi graph $\mathcal{G}_{n,p}$, with $p=n^{-\frac{2}{\alpha-1}}$ chosen…

Computational Complexity · Computer Science 2025-01-17 Jarosław Błasiok , Linus Meierhöfer

A Costas array is a permutation array for which the vectors joining pairs of $1$s are all distinct. We propose a new three-dimensional combinatorial object related to Costas arrays: an order $n$ Costas cube is an array $(d_{i,j,k})$ of size…

Combinatorics · Mathematics 2017-08-04 Jonathan Jedwab , Lily Yen

Let ${\mathscr L}=(X,\preceq)$ be a lattice. For ${\cal P}\subseteq X$ we say that ${\cal P}$ is $t$-{\it intersecting} if ${\sf rank}(x\wedge y)\ge t$ for all $x,y\in{\cal P}$. The seminal theorem of Erd\H{o}s, Ko and Rado describes the…

Combinatorics · Mathematics 2019-04-03 Susanna Fishel , Glenn Hurlbert , Vikram Kamat , Karen Meagher

Let $\alpha:\mathbb{F}_q\to\mathbb{F}_q$ be a permutation and $\Psi(\alpha)$ be the number of collinear triples in the graph of $\alpha$, where $\mathbb{F}_q$ denotes a finite field of $q$ elements. When $q$ is odd Cooper and Solymosi once…

Combinatorics · Mathematics 2008-05-06 Liangpan Li

In this short note, we address two problems in extremal set theory regarding intersecting families. The first problem is a question posed by Kupavskii: is it true that given two disjoint cross-intersecting families $\mathcal{A}, \mathcal{B}…

Combinatorics · Mathematics 2018-05-01 Hao Huang

We investigate the product measures of intersection problems in extremal combinatorics. Invoking a recent result of He--Li--Wu--Zhang, we prove that for any $ n \geq t \geq 3$ and $ p_1, p_2 \in (0, \frac{1}{t+1})$, if $ \mathcal{F}_1,…

Combinatorics · Mathematics 2026-01-13 Yongjiang Wu , Yongtao Li , Zhiyi Liu , Lihua Feng

A family of axis-aligned boxes in $\er^d$ is \emph{$k$-neighborly} if the intersection of every two of them has dimension at least $d-k$ and at most $d-1$. Let $n(k,d)$ denote the maximum size of such a family. It is known that $n(k,d)$ can…

Combinatorics · Mathematics 2023-03-06 Noga Alon , Jarosław Grytczuk , Andrzej P. Kisielewicz , Krzysztof Przesławski
‹ Prev 1 3 4 5 6 7 10 Next ›