English
Related papers

Related papers: On growth of the number of determinants with restr…

200 papers

Let $A$ be a set in a prime field $\mathbb{F}_p$. In this paper, we prove that $d\times d$ matrices with entries in $A$ determine almost $|A|^{3+\frac{1}{45}}$ distinct determinants and almost $|A|^{2-\frac{1}{6}}$ distinct permanents when…

Combinatorics · Mathematics 2019-08-14 Doowon Koh , Thang Pham , Chun-Yen Shen , Le Anh Vinh

For a prime power $q$, we study the distribution of determinent of matrices with restricted entries over a finite field $\mathbbm{F}_q$ of $q$ elements. More precisely, let $N_d (\mathcal{A}; t)$ be the number of $d \times d$ matrices with…

Combinatorics · Mathematics 2009-03-17 Le Anh Vinh

We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…

Combinatorics · Mathematics 2017-11-29 Henning Bruhn , Dieter Rautenbach

Consider a matrix $M$ chosen uniformly at random from a class of $m \times n$ matrices of zeros and ones with prescribed row and column sums. A partially filled matrix $D$ is a $\mathit{defining}$ $\mathit{set}$ for $M$ if $M$ is the unique…

Combinatorics · Mathematics 2020-06-26 Carly Bodkin , Anita Liebenau , Ian M. Wanless

Let $\mathbb{F}_q$ be an arbitrary finite field of order $q$. In this article, we study $\det S$ for certain types of subsets $S$ in the ring $M_2(\mathbb F_q)$ of $2\times 2$ matrices with entries in $\mathbb F_q$. For $i\in \mathbb{F}_q$,…

Combinatorics · Mathematics 2019-04-17 Daewoong Cheong , Doowon Koh , Thang Pham , Anh Vinh Le

Let ${\cal A}=\{A_1,\ldots, A_r\}$ be a partition of a set $\{1,\ldots,m\}\times\{1,\ldots, n\}$ into $r$ nonempty subsets, and $A=(a_{ij})$ be an $m\times n$ matrix. We say that $A$ has a pattern ${\cal A}$ provided that $a_{ij}=a_{i'j'}$…

Combinatorics · Mathematics 2016-05-25 Maria Axenovich , Ryan R. Martin

Denote by $f_D(n)$ the maximum size of a set family $\mathcal{F}$ on $[n] \stackrel{\mbox{\normalfont\tiny def}}{=} \{1, \dots, n\}$ with distance set $D$. That is, $|A \bigtriangleup B| \in D$ holds for every pair of distinct sets $A, B…

Combinatorics · Mathematics 2025-12-09 Zichao Dong , Jun Gao , Hong Liu , Minghui Ouyang , Qiang Zhou

Let $\mathbb{F}_q$ be a finite field of order $q$, where $q$ is a power of a prime. For a set $A \subset \mathbb{F}_q$, under certain structural restrictions, we prove a new explicit lower bound on the size of the product set $A(A + 1)$.…

Number Theory · Mathematics 2018-07-31 Ali Mohammadi

A theorem of Mina evaluates the determinant of a matrix with entries $D^j(f(x)^i)$. We note the important special case where the matrix entries are evaluated at $x=0$ and give a simple proof of it, and some applications. We then give a…

Combinatorics · Mathematics 2007-05-23 Herbert S. Wilf

We investigate how the behavior of the function d_A(n) that gives the size of a least size generating set for A^n, influences the structure of a finite solvable algebra A.

Rings and Algebras · Mathematics 2014-11-04 Keith A. Kearnes , Emil W. Kiss , Ágnes Szendrei

We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…

Discrete Mathematics · Computer Science 2025-06-17 Jamolidin K. Abdurakhmanov

We prove that for any finite set A of real numbers its difference set D:=A-A has large product set and quotient set, namely, |DD|, |D/D| \gg |D|^{1+c}, where c>0 is an absolute constant. A similar result takes place in the prime field F_p…

Number Theory · Mathematics 2016-10-04 Ilya D. Shkredov

We consider the set $\mathcal M_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper bounds on the number of matrices from $\mathcal M_n(\mathbb Z; H)$, for which the characteristic polynomial…

Number Theory · Mathematics 2026-03-26 Alina Ostafe , Igor E. Shparlinski

Suppose $F$ is an infinite field and let $f \in F\{X_1, \dots,X_m\}$ be a noncommutative polynomial. Partially answering a query of Makar-Limanov, we show that there are numbers $d$ and $m'$ such that, if $F$ is closed under taking $d$th…

Rings and Algebras · Mathematics 2026-03-02 Louis H. Rowen , Uzi Vishne

Let D\subseteq \mathbb{R} be closed and discrete and f:D^n \to \mathbb{R} be such that f(D^n) is somewhere dense. We show that (\mathbb{R},+,\cdot,f) defines the set of integers. As an application, we get that for every a,b \in \mathbb{R}…

Logic · Mathematics 2010-06-03 Philipp Hieronymi

Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…

Number Theory · Mathematics 2025-02-12 Aaron Manning , Alina Ostafe , Igor E. Shparlinski

For a given finite set $\Sigma$ of matrices with nonnegative integer entries we study the growth of $$ \max_t(\Sigma) = \max\{\|A_{1}... A_{t}\|: A_i \in \Sigma\}.$$ We show how to determine in polynomial time whether the growth with $t$ is…

Computational Complexity · Computer Science 2007-05-23 Raphaël Jungers , Vladimir Protasov , Vincent D. Blondel

The Seidel matrix of a tournament on $n$ players is an $n\times n$ skew-symmetric matrix with entries in $\{0, 1, -1\}$ that encapsulates the outcomes of the games in the given tournament. It is known that the determinant of an $n\times n$…

Combinatorics · Mathematics 2024-06-17 Sarah Klanderman , MurphyKate Montee , Andrzej Piotrowski , Alex Rice , Bryan Shader

Fix a density d in (0,1], and let F_p^n be a finite field, where we think of p fixed and n tending to infinity. Let S be any subset of F_p^n having the minimal number of three-term progressions, subject to the constraint |S| is at least…

Number Theory · Mathematics 2007-05-23 Ernie Croot

The $\mathit{growth\ rate\ function}$ for a nonempty minor-closed class of matroids $\mathcal{M}$ is the function $h_{\mathcal{M}}(n)$ whose value at an integer $n \ge 0$ is defined to be the maximum number of elements in a simple matroid…

Combinatorics · Mathematics 2014-10-29 Jim Geelen , Peter Nelson
‹ Prev 1 2 3 10 Next ›