Related papers: Counting integer matrices with square-free determi…

We obtain an asymptotic formula for the number of integer $2\times 2$ matrices that have determinant $\Delta$ and whose absolute values of the entries are at most $H$. The result holds uniformly for a large range of $\Delta$ with respect to…

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 a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

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…

We count mxn non-negative integer matrices (contingency tables) with prescribed row and column sums (margins). For a wide class of smooth margins we establish a computationally efficient asymptotic formula approximating the number of…

A square-free integer is a positive integer that is not divisible by the square of any prime. Merten's function, $M(x)$ is defined as the difference between the number of square free integers with an even number of prime factors and the…

We study some counting questions concerning products of positive integers $u_1, \ldots, u_n$ which form a non-zero perfect square, or more generally, a perfect $k$-th power. We obtain an asymptotic formula for the number of such integers of…

Given positive integers $h, N$ satisfying $1 \leqslant h \leqslant 2N^2$, we define $T(h,N)$ to be the number of $2\times 2$ integer matrices with determinant equal to $h$ whose entries lie in $[-N,N]$. Our main result states that for any…

A Heffter array $H(m,n;s,t)$ is an $m \times n$ matrix with nonzero entries from $\mathbb{Z}_{2ms+1}$ such that $i)$ each row contains $s$ filled cells and each column contains $t$ filled cells, $ii)$ every row and column sum to 0, and…

It is not difficult to find an asymptotic formula for the number of pairs of positive integers $x, y \le H$ such that $x^2 + y^2 + 1$ is squarefree. In the present paper we improve the estimate for the error term in this formula using the…

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…

In this article, we study necessary conditions for certain square-free integers to be congruent numbers. Our method uses divisibility properties of class numbers of related imaginary quadratic fields. We first consider positive square-free…

We study few properties of square-free integers in certain equations. Using this property, we derive some infinite products in powers of square free numbers. Also, we present a method, to convert power series and trigonometric series to…

We give an asymptotic expression for the number of nonsingular integer n-by-n-matrices with primitive row vectors, determinant k, and Euclidean matrix norm less than T, for large T. We also investigate the density of matrices with primitive…

We prove almost sure strong asymptotic freeness of i.i.d. random unitaries with the following law: sample a Haar unitary matrix of dimension $n$ and then send this unitary into an irreducible representation of $U(n)$. The strong convergence…

We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct…

In this paper we show that there exist infinitely many square-free numbers of the form $n^2+n+1$. We achieve this by deriving an asymptotic formula by improving the reminder term from previous results.

We compute the asymptotics of the determinants of certain $n\times n$ Toeplitz + Hankel matrices $T_n(a)+H_n(b)$ as $n\to\infty$ with symbols of Fisher-Hartwig type. More specifically we consider the case where $a$ has zeros and poles and…

A Heffter array $H(n;k)$ is an $n\times n$ matrix such that each row and column contains $k$ filled cells, each row and column sum is divisible by $2nk+1$ and either $x$ or $-x$ appears in the array for each integer $1\leq x\leq nk$.…

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

A theorem of Gekeler compares the number of non-isomorphic automorphic representations associated with the space of cusp forms of weight $k$ on $\Gamma_0(N)$ to a simpler function of $k$ and $N$, showing that the two are equal whenever $N$…