English
Related papers

Related papers: Sets Avoiding Full-Rank Three-Point Patterns in $(…

200 papers

Two sets $A$ and $B$ of points in the plane are \emph{mutually avoiding} if no line generated by any two points in $A$ intersects the convex hull of $B$, and vice versa. In 1994, Aronov, Erd\H os, Goddard, Kleitman, Klugerman, Pach, and…

Combinatorics · Mathematics 2020-06-23 Mozhgan Mirzaei , Andrew Suk

We prove that the total number $S_{n,132}(q)$ of copies of the pattern $q$ in all 132-avoiding permutations of length $n$ is the same for $q=231$, $q=312$, or $q=213$. We provide a combinatorial proof for this unexpected threefold symmetry.…

Combinatorics · Mathematics 2012-02-10 Miklos Bona

Peter Lappan in [9] proved that for each $n\in \mathbb{N}=\{1,2,3,\dots\}$, let $f_{1,n}, f_{2,n}$ and $f_{3,n}$ be three continuous functions on $\mathbb{D}:=\{z\in \mathbb{C} : |z| < 1\}$ such that for each $j=1,2,3,$ the sequence…

Complex Variables · Mathematics 2026-05-13 Gopal Datt , Kushal Lalwani , Ashish Kumar Trivedi

For any affine hypersurface defined by a complete symmetric polynomial in $k\geq 3$ variables of degree $m$ over the finite field $\mathbb{F}_{q}$ of $q$ elements, a special case of our theorem says that this hypersurface has at least…

Number Theory · Mathematics 2020-07-23 Jun Zhang , Daqing Wan

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…

Combinatorics · Mathematics 2023-05-31 Adam Kabela , Michal Polák , Jakub Teska

The Fibonacci groups $F(n)$ are known to exhibit significantly different behaviour depending on the parity of $n$. We extend known results for $F(n)$ for odd $n$ to the family of Fractional Fibonacci groups $F^{k/l}(n)$. We show that for…

Group Theory · Mathematics 2022-03-29 Ihechukwu Chinyere , Gerald Williams

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…

Number Theory · Mathematics 2025-08-12 Herivelto Borges , Lucas Reis

Let $q$ be a prime power and $k$ be a natural number. What are the possible cardinalities of point sets ${S}$ in a projective plane of order $q$, which do not intersect any line at exactly $k$ points? This problem and its variants have been…

Combinatorics · Mathematics 2024-09-24 Tamás Héger , Zoltán Lóránt Nagy

Let $V$ denote an $r$-dimensional $\mathbb{F}_{q^n}$-vector space. For an $m$-dimensional $\mathbb{F}_q$-subspace $U$ of $V$ assume that $\dim_q \left(\langle {\bf v}\rangle_{\mathbb{F}_{q^n}} \cap U\right) \geq 2$ for each non zero vector…

Combinatorics · Mathematics 2025-01-27 Bence Csajbók , Giuseppe Marino , Valentina Pepe

Given $d,n \in \mathbb{N}$, we write a polynomial $F \in \mathbb{C}[x_1,\dots,x_n]$ to be degenerate if there exist $P\in \mathbb{C}[y_1, \dots, y_{n-1}]$ and $m_j = x_1^{v_{j,1}}\dots x_n^{v_{j,n}}$ with $v_{j,1}, \dots, v_{j,n} \in…

Combinatorics · Mathematics 2023-08-09 Akshat Mudgal

This paper studies the low-rank property of the inverse of a class of large-scale structured matrices in the tensor-train (TT) format, which is typically discretized from differential operators. An interesting question that we are concerned…

Numerical Analysis · Mathematics 2025-01-14 Chuanfu Xiao , Kejun Tang , Zhitao Zhu

In these notes we study the $k$-generalized Fibonacci sequences - $(F_n^{(k)})_{n\in \Z}$ - with positive and negative indices. Denote $T_k(x)$ its characteristic polynomial. Our most interesting finding is that if $k$ is even then the…

Number Theory · Mathematics 2020-08-26 Attila Pethő

We investigate uniform random block lower bidiagonal matrices over the finite field $\mathbb{F}_q$, and prove that their rank undergoes a phase transition. First, we consider block lower bidiagonal matrices with $(k_n+1)\times k_n$ blocks…

Probability · Mathematics 2025-04-17 András Mészáros

A $1$-avoiding set is a subset of $\mathbb{R}^n$ that does not contain pairs of points at distance $1$. Let $m_1(\mathbb{R}^n)$ denote the maximum fraction of $\mathbb{R}^n$ that can be covered by a measurable $1$-avoiding set. We prove two…

Metric Geometry · Mathematics 2018-03-12 Tamás Keleti , Máté Matolcsi , Fernando Mário de Oliveira Filho , Imre Z. Ruzsa

We consider uniformly random strictly upper-triangular matrices in $\operatorname{Mat}_n(\mathbb{F}_q)$. For such a matrix $A_n$, we show that $n-\operatorname{rank}(A_n) \approx \log_q n$ as $n \to \infty$, and find that the fluctuations…

Probability · Mathematics 2026-01-14 Roger Van Peski

We prove that the algebraic set of pairs of matrices with a diagonal commutator over a field of positive prime characteristic, its irreducible components, and their intersection are $F$-pure when the size of matrices is equal to 3.…

Commutative Algebra · Mathematics 2017-12-15 Zhibek Kadyrsizova

Motivated by topological Tverberg-type problems and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into R^d without triple, quadruple, or, more…

Geometric Topology · Mathematics 2015-08-13 Isaac Mabillard , Uli Wagner

In this paper, we construct explicit families of polynomials $P \in \mathbb{F}_q[x_1,\dots,x_n]$ with large root sets which have restricted intersections with affine lines. We use these sets to make substantial progress on a number of…

Combinatorics · Mathematics 2026-02-12 Jakob Führer , Vladislav Taranchuk

Fix a vector space over a finite field and a system of linear equations. We provide estimates, in terms of the dimension of the vector space, of the maximum of the sizes of subsets of the space that do not admit solutions of the system…

Combinatorics · Mathematics 2019-09-24 Masato Mimura , Norihide Tokushige

Let k >= 2 and F be a linear k-uniform hypergraph with v vertices. We prove that if n is sufficiently large and v|n, then every quasirandom k-uniform hypergraph on n vertices with constant edge density and minimum degree $\Omega(n^{k-1})$…

Combinatorics · Mathematics 2014-02-18 John Lenz , Dhruv Mubayi
‹ Prev 1 4 5 6 7 8 10 Next ›