Related papers: Counting tuples restricted by coprimality conditio…
This paper investigates the dependence between primes in tuples through the analysis of the Hardy-Littlewood constant. A detailed analysis of the behavior of the constant for the pattern $(0,d)$ is conducted, depending on the arithmetic…
Let $a_{1},...,a_{n}, b_{1},...,b_{n}$ be random variables in some (non-commutative) probability space, such that $\{a_{1}, ..., a_{n} \}$ is free from $\{b_{1}, ..., b_{n} \}$. We show how the joint distribution of the $n$-tuple $(a_{1}…
In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…
Define a permutation $\sigma$ to be coprime if $\gcd(m,\sigma(m)) = 1$ for $m\in[n]$. In this note, proving a recent conjecture of Pomerance, we prove that the number of coprime permutations on $[n]$ is $n!\cdot (c+o(1))^n$ where \[c =…
An $n$-tuple of operators $(V_1,...,V_n)$ acting on a Hilbert space $H$ is said to be isometric if the row operator $(V_1,...,V_n) : H^n \to H$ is an isometry. We prove that every isometric $n$-tuple is hyperreflexive, in the sense of…
We express classical, free, Boolean and monotone cumulants in terms of each other, using combinatorics of heaps, pyramids, Tutte polynomials and permutations. We completely determine the coefficients of these formulas with the exception of…
For an integer $k\ge2$, a tuple of $k$ positive integers $(M_i)_{i=1}^{k}$ is called an amicable $k$-tuple if the equation \[ \sigma(M_1)=\cdots=\sigma(M_k)=M_1+\cdots+M_k \] holds. This is a generalization of amicable pairs. An amicable…
We study the matrix range of a tuple of compact operators on a Hilbert space and examine the notions of minimal, nonsingular, and fully compressed tuples. In this pursuit, we refine previous results by characterizing nonsingular compact…
Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…
Starting with Zhang's theorem on the infinitude of prime doubles, we give an inductive argument that there exists an infinite number of prime $k$-tuples for at least one admissible set $\mathcal{H}_k=\{h_1,\ldots,h_k\}$ for each $k$.
Let a and x denote tuples of (jointly) freely noncommuting variables. A square matrix valued polynomial p in these variables is naturally evaluated at a tuple (A,X) of symmetric matrices with the result p(A,X) a square matrix. The…
Let $a_1$, $a_2$, and $a_3$ be distinct reduced residues modulo $q$ satisfying the congruences $a_1^2 \equiv a_2^2 \equiv a_3^2 \pmod q$. We conditionally derive an asymptotic formula, with an error term that has a power savings in $q$, for…
S. Ekhad and D. Zeilberger recently proved that the multivariate generating function for the number of simple singular vector tuples of a generic $m_1 \times \cdots \times m_d$ tensor has an elegant rational form involving elementary…
We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…
Given a graph $G=(V,E)$ with $V=\{1,2,...,k\}$, the $k$ positive integers $a_1,a_2, ...,a_k$ are $G$-wise relatively prime if $(a_i, a_j)=1$ for $\{i,j\} \in E$. In this note we consider the problem of finding the probability $A_G$ that k…
We classify the coefficients $(a_1,...,a_n) \in \mathbb{F}_q[t]^n$ that can appear in a linear relation $\sum_{i=1}^n a_i \gamma_i =0$ among Galois conjugates $\gamma_i \in \overline{\mathbb{F}_q(t)}$. We call such an $n$-tuple a Smyth…
We study interpolating sequences of $d$-tuples of matrices, by looking at the commuting and the non-commuting case separately. In both cases, we will give a characterization of such sequences in terms of separation conditions on suitable…
A well-known result of Bollob\'as says that if $\{(A_i, B_i)\}_{i=1}^m$ is a set pair system such that $|A_i| \le a$ and $|B_i| \le b$ for $1 \le i \le m$, and $A_i \cap B_j \ne \emptyset$ if and only if $i \ne j$, then $m \le {a+b \choose…
We prove that there are infinitely often pairs of primes much closer than the average spacing between primes - almost within the square root of the average spacing. We actually prove a more general result concerning the set of values taken…
Given positive integers $a_1,\ldots,a_k$, we prove that the set of primes $p$ such that $p \not\equiv 1 \bmod{a_i}$ for $i=1,\ldots,k$ admits asymptotic density relative to the set of all primes which is at least $\prod_{i=1}^k…