Related papers: Coprime matchings

For $s=3,4$, we prove the existence of arbitrarily long sequences of consecutive integers none of which is a sum of $s$ nonnegative $s$-th powers. More generally, we study the existence of gaps between the values $\leq N$ of diagonal forms…

An positive even number is said to be a Kronecker number if it can be written in infinitely many ways as the difference between two primes, and it is believed that all even numbers are Kronecker numbers. We will study the division and…

We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than what might naively be expected. One application is a simple…

We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…

Let c(F) be the number of perfect pairs of F and c(G) be the maximum of c(F) over all (near-) one-factorizations F of G. Wagner showed that for odd n, c(K_{n}) \geq n*phi(n)/2 and for m and n which are odd and co-prime to each other,…

A positive integer n is said to be perfect if sigma(n)=2n, where sigma denotes the sum of the divisors of n. In this article, we show that if n is an even perfect number, then any integer m<=n is expressed as a sum of some of divisors of n.

The paper provides a connection between Commutative Algebra and Integer Programming and contains two parts. The first one is devoted to the asymptotic behavior of integer programs with a fixed cost linear functional and the constraint sets…

In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is…

Let G be a graph and let I be its edge ideal. Our main result shows that the sets of associated primes of the powers of I form an ascending chain. It is known that the sets of associated primes of I(i) and intcl(I(i)) stabilize for large i,…

Let $P$ be a finite poset. Let $L:=J(P)$ denote the lattice of order ideals of $P$. Let $b_i(L)$ denote the number of Boolean intervals of $L$ of rank $i$. We construct a simple graph $G(P)$ from our poset $P$. Denote by $f_i(P)$ the number…

The Lonely Runner Conjecture asserts that if $n$ runners with distinct constant speeds run on the unit circle $\mathbb{R}/\mathbb{Z}$ starting from $0$ at time $0$, then each runner will at some time $t>0$ be lonely in the sense that she/he…

We consider a linear runs and tumbles equation in dimension d $\ge$ 1 for which we establish the existence of a unique positive and normalized steady state as well as its asymptotic stability, improving similar results obtained by Calvez et…

For coprime positive integers $q$ and $e$, let $m(q,e)$ denote the least positive integer $t$ such that there exists a sum of $t$ powers of $q$ which is divisible by $e$. We prove an upper bound for $m(q.e)$ and investigate the case where…

In this paper, we study the problem of recovering the latent vertex correspondence between two correlated random graphs with vastly inhomogeneous and unknown edge probabilities between different pairs of vertices. Inspired by and extending…

We introduce new sufficient conditions for permutation and monomial equivalence of linear cyclic codes over various finite fields. We recall that monomial equivalence and isometric equivalence are the same relation for linear codes over…

Given integers $2 \leq p \leq c \leq q$, we construct a finite simple graph $G$ with $\nu_1(G) = p$ and $\nu(G) = q$ for which the squarefree power $I(G)^{[k]}$ of the edge ideal $I(G)$ of $G$ has linear quotients for each $c \leq k \leq q$…

In this paper, we consider the simultaneous representation of pairs of sufficiently large integers. We prove that every pair of large positive odd integers can be represented in the form of a pair of one prime, four cubes of primes and 231…

For two odd primes $p$ and $q$ such that $p<q$, let $A(p,q):=(a_k)_{k=1}^{\infty}$ be the arithmetic progression whose $k$th term is given by $a_k=(k-1)(q-p)+p$ (i.e., with $a_1=p$ and $a_2=q$). Here we conjecture that for every positive…

We study the \emph{Lonely Runner Conjecture}, conceived by J\"org M.~Wills in the 1960's: Given positive integers $n_1, n_2, \dots, n_k$, there exists a positive real number $t$ such that for all $1 \le j \le k$ the distance of $t \, n_j$…

Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…