Related papers: Gasper's determinant theorem, revisited

We use transference principle to show that whenever $s$ is suitably large depending on $k \geq 2$, every sufficiently large natural number $n$ satisfying some congruence conditions can be written in the form $n = p_1^k + \dots + p_s^k$,…

For an $N \times T$ random matrix $X(\beta)$ with weakly dependent uniformly sub-Gaussian entries $x_{it}(\beta)$ that may depend on a possibly infinite-dimensional parameter $\beta\in \mathbf{B}$, we obtain a uniform bound on its operator…

The Szeg\H{o} limit theorem by Fedele and Gebert for matrices of the type identity minus Hankel matrix is proved for the special case $1-\frac{\beta}{\pi}H_{N,\alpha}$ where $H_{N,\alpha}$ is the $N\times N$-Hilbert matrix,…

When the discriminants $\Delta$ and $\Delta p^2$ are idoneal, Patane proved a theorem which connects the theta series associated to binary quadratic forms of each discriminant. This paper generalizes the main theorem of Patane by no longer…

We consider the infinite sequences $(A\_n)\_{n\in\NN}$ of $2\times2$ matrices with nonnegative entries, where the $A\_n$ are taken in a finite set of matrices. Given a vector $V=\pmatrix{v\_1\cr v\_2}$ with $v\_1,v\_2>0$, we give a…

In this short note, we prove that for $\mathcal{E} \subset \mathbb{F}_q^d$ with $|\mathcal{E}| \geq q^{d-1} + O(q^2)$ then the set of determinants generated by $\mathcal{E}$ is $\mathbb{F}_q.$ This result is nearly optimal and generalizes…

We prove a strengthened form of a conjecture of Sun on a determinant attached to a binary quadratic form. Let $n>3$ and let $c,d\in\Z$. If $n$ is composite, then \[ \det\big[(i^2+cij+dj^2)^{n-2}\big]_{0\leq i,j\leq n-1}\equiv 0\pmod {n^2}…

We study arithmetical and combinatorial properties of $\beta$-integers for $\beta$ being the root of the equation $x^2=mx-n, m,n \in \mathbb N, m \geq n+2\geq 3$. We determine with the accuracy of $\pm 1$ the maximal number of…

Let $\sigma(n)$ denote the sum of the positive divisors of $n$. We say that $n$ is perfect if $\sigma(n) = 2 n$. Currently there are no known odd perfect numbers. It is known that if an odd perfect number exists, then it must be of the form…

In a celebrated paper of 1893, Hadamard established the maximal determinant theorem, which establishes an upper bound on the determinant of a matrix with complex entries of norm at most $1$. His paper concludes with the suggestion that…

This paper presents a theorem which solves the problem of reduction of the determinant order by means of a transformation of it, into other determinant whose each element are a determinant of second order. This implies that, if the process…

We determine the probability that a random n x n symmetric matrix over {1, 2, ... , m} has determinant divisible by m.

Let $\mathbb{F}_q$ be the finite field of order $q$, and $\mathcal{A}$ a non-empty proper subset of $\mathbb{F}_q$. Let $\mathbf{M}$ be a random $m \times n$ matrix of rank $r$ over $\mathbb{F}_q$ taken with uniform distribution. It was…

We investigate matching for the family $T_\alpha(x) = \beta x + \alpha \pmod 1$, $\alpha \in [0,1]$, for fixed $\beta > 1$. Matching refers to the property that there is an $n \in \mathbb N$ such that $T_\alpha^n(0) = T_\alpha^n(1)$. We…

Relatively little is known about the arithmetic properties of Gamma-function derivatives evaluated at arbitrary points $q\in\mathbb{Q}\setminus\mathbb{Z}_{\leq0}$. In recent work, we showed that the sequence…

Let $\lambda$ be a partition with no more than $n$ parts. Let $\beta$ be a weakly increasing $n$-tuple with entries from $\{ 1, ... , n \}$. The flagged Schur function in the variables $x_1, ... , x_n$ that is indexed by $\lambda$ and…

Denote $\Sigma_n$ and $Q_n$ the set of all $n \times n$ symmetric and skew-symmetric matrices over a field $\mathbb{F}$, respectively, where $char(\mathbb{F})\neq 2$ and $\lvert \mathbb{F} \rvert \geq n^2+1$. A characterization of…

Using an approach of Bergh, we give an alternate proof of Bennett's result on lower bounds for non-negative matrices acting on non-increasing non-negative sequences in $l^p$ when $p \geq 1$ and its dual version, the upper bounds when $0<p…

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

Fix a positive real number $\theta$. The natural numbers $m$ with largest square-free divisor not exceeding $m^\theta$ form a set $\mathscr{A}$, say. It is shown that whenever $\theta>1/2$ then all large natural numbers $n$ are the sum of…