English
Related papers

Related papers: A lower bound for the r-order of a matrix modulo N

200 papers

K be a field and let m and n be positive integers, where m does not exceed n. We say that a non-zero subspace of m x n matrices over K is a constant rank r subspace if each non-zero element of the subspace has rank r, where r is a positive…

Rings and Algebras · Mathematics 2015-01-13 Rod Gow

Let $E/\mathbb{Q}$ be an elliptic curve. For a prime $p$ of good reduction, let $r(E,p)$ be the smallest non-negative integer that gives the $x$-coordinate of a point of maximal order in the group $E(\mathbb{F}_p)$. We prove unconditionally…

Number Theory · Mathematics 2021-06-21 Steven Jin , Lawrence C. Washington

An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…

Quantum Physics · Physics 2023-03-15 Nikhil S. Mande , Justin Thaler , Shuchen Zhu

The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(M_int(N^(1/4) log N)), where M_int(k) denotes the cost of multiplying k-bit integers. This result is due to…

Number Theory · Mathematics 2012-01-11 Edgar Costa , David Harvey

We determine sufficient conditions for certain classes of $(n+k) \times n$ matrices $E$ to have all order-$n$ minors to be nonzero. For a special class of $(n+1) \times n$ matrices $E,$ we give the formula for the order-$n$ minors. As an…

Functional Analysis · Mathematics 2020-08-12 Priyabrata Bag , Santanu Dey , Masaru Nagisa , Hiroyuki Osaka

Let $NPO(k)$ be the smallest number $n$ such that the adjacency matrix of any undirected graph with $n$ vertices or more has at least $k$ nonpositive eigenvalues. We show that $NPO(k)$ is well-defined and prove that the values of $NPO(k)$…

Combinatorics · Mathematics 2012-05-29 Zachary B. Charles , Miriam Farber , Charles R. Johnson , Lee Kennedy-Shaffer

Let $S_n$ be the symmetric group of $n$ letters; Landau considered the function $g(n)$ defined as the maximal order of an element of $S_n$. This function is non-decreasing. Let us define the sequence $n_1=1, n_2=2, n_3=3, n_4=4,n_5=5,n_6=7,…

Number Theory · Mathematics 2013-12-10 Jean-Louis Nicolas

Let $E/k$ be a non-isotrivial elliptic curve over a global function field $k$ of characteristic $p>3$, and $G\subset \mathrm{Gal}(k^{\mathrm{sep}}/k)$ be a topologically finitely generated subgroup. We prove that if $E/k$ has analytic rank…

Number Theory · Mathematics 2026-04-01 Seokhyun Choi , Bo-Hae Im , Beomho Kim

We prove that the sequence $(N_k)_k$, where each $N_k$ is defined as the smallest positive integer $n$ for which the $n$th term $g_{k,n}$ of the $k$-G\"obel sequence is not an integer, is unbounded.

Combinatorics · Mathematics 2025-02-26 Yuh Kobayashi , Shin-ichiro Seki

The rigidity of a matrix A for target rank r is the minimum number of entries of A that must be changed to ensure that the rank of the altered matrix is at most r. Since its introduction by Valiant (1977), rigidity and similar…

Computational Complexity · Computer Science 2015-01-27 Abhinav Kumar , Satyanarayana V. Lokam , Vijay M. Patankar , Jayalal Sarma M. N

We provide an answer to a question raised by Levine and Weinberger in their $1986$ paper concerning the difference between Dirichlet and Neumann eigenvalues of the Laplacian on bounded domains in $\mathbb{R}^{n}$. More precisely, we show…

Spectral Theory · Mathematics 2025-06-30 Pedro Freitas , Miguel Gama

Let $E$ be an elliptic curve over a number field $K$ defined by a monic irreducible cubic polynomial $F(x)$. When $E$ is \textit{nice} at all finite primes of $K$, we bound its $2$-Selmer rank in terms of the $2$-rank of a modified ideal…

Number Theory · Mathematics 2022-12-06 Hwajong Yoo , Myungjun Yu

In the Determinant Maximization problem, given an $n\times n$ positive semi-definite matrix $\bf{A}$ in $\mathbb{Q}^{n\times n}$ and an integer $k$, we are required to find a $k\times k$ principal submatrix of $\bf{A}$ having the maximum…

Data Structures and Algorithms · Computer Science 2024-02-20 Naoto Ohsaka

Let $M_n$ be a random $n\times n$ matrix with i.i.d. $\text{Bernoulli}(1/2)$ entries. We show that for fixed $k\ge 1$, \[\lim_{n\to \infty}\frac{1}{n}\log_2\mathbb{P}[\text{corank }M_n\ge k] = -k.\]

Probability · Mathematics 2021-03-04 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

Let $K=Z/pZ$ and let $A$ be a subset of $\GL_r(K)$ such that $<A>$ is solvable. We reduce the study of the growth of $A$ under the group operation to the nilpotent setting. Specifically we prove that either $A$ grows rapidly (meaning…

Group Theory · Mathematics 2013-09-11 Nick Gill , Harald Andres Helfgott

Given a subgroup $\Gamma$ of rational points on an elliptic curve $E$ defined over ${\mathbf Q}$ of rank $r \ge 1$ and any sufficiently large $x \ge 2$, assuming that the rank of $\Gamma$ is less than $r$, we give upper and lower bounds on…

Number Theory · Mathematics 2018-12-04 Min Sha , Igor E. Shparlinski

We prove that for any real-valued matrix $X \in \R^{m \times n}$, and positive integers $r \ge k$, there is a subset of $r$ columns of $X$ such that projecting $X$ onto their span gives a $\sqrt{\frac{r+1}{r-k+1}}$-approximation to best…

Data Structures and Algorithms · Computer Science 2015-03-19 Venkatesan Guruswami , Ali Kemal Sinop

Let $E$ be an elliptic curve defined over a number field $K$. We say that a prime number $p$ is exceptional for $(E,K)$ if $E$ admits a $p$-isogeny defined over $K$. The so-called exceptional set of all such prime numbers is finite if and…

Number Theory · Mathematics 2010-04-28 Nicolas Billerey

A dimension group is a partially ordered countable group such that (1) every finite subset is contained in an ordered subgroup which is a finite direct power of Z and (2) the group has an order unit i.e. a positive element u such that every…

Group Theory · Mathematics 2007-05-23 Gábor Braun

The nonnegative rank of a matrix A is the smallest integer r such that A can be written as the sum of r rank-one nonnegative matrices. The nonnegative rank has received a lot of attention recently due to its application in optimization,…

Optimization and Control · Mathematics 2016-08-10 Hamza Fawzi , Pablo A. Parrilo