English
Related papers

Related papers: Uniqueness conjectures for extended Markov numbers

200 papers

Let $n$ be a nonzero integer. A set of $m$ positive integers is called a $D(n)$-$m$-tuple if the product of any two of its distinct elements increased by $n$ is a perfect square. Let $k$ be a positive integer. By elementary means, we show…

Number Theory · Mathematics 2017-07-31 Nikola Adžaga , Alan Filipin

Let $1 \leq a \leq b$ be integers. A triple of the form $(x,ax+d,bx+2d)$, where $x,d$ are positive integers is called an {\em (a,b)-triple}. The {\em degree of regularity} of the family of all $(a,b)$-triples, denoted dor($a,b)$, is the…

Combinatorics · Mathematics 2007-05-23 Nikos Frantzikinakis , Bruce Landman , Aaron Robertson

For positive integers m and r, one can easily show there exist integers N such that for every map D:{1,2,...,N} -> {1,2,...,r} there exist 2m integers x_1 < ... < x_m < y_1 < ... < y_m which satisfy: (a) D(x_1) = ... = D(x_m), (b) D(y_1) =…

Combinatorics · Mathematics 2007-05-23 Andrew Schultz

For a fixed unit vector $a=(a_1,a_2,\ldots,a_n)\in S^{n-1}$, we consider the $2^n$ sign vectors $\varepsilon=(\varepsilon^1,\varepsilon^2,\ldots,\varepsilon^n)\in \{+1,-1\}^n$ and the corresponding scalar products $\varepsilon\cdot…

Combinatorics · Mathematics 2017-03-22 Harrie Hendriks , Martien C. A. van Zuijlen

Some new results concerning the equation $\sigma(N)=aM, \sigma(M)=bN$ are proved. As a corollary, there are only finitely many odd superperfect numbers with a fixed number of distinct prime factors.

Number Theory · Mathematics 2020-10-21 Tomohiro Yamada

Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which…

Logic in Computer Science · Computer Science 2023-08-02 Artur Jeż , Anthony W. Lin , Oliver Markgraf , Philipp Rümmer

In this paper, the connections between model theory and the theory of infinite permutation groups are used to study the n-existence and the n-uniqueness for n-amalgamation problems of stable theories. We show that, for any n>1, there exists…

Logic · Mathematics 2010-07-06 Elisabetta Pastori , Pablo Spiga

We discuss conjectures related to the following two conjectures: (1) for each complex numbers x_1,...,x_n there exist rationals y_1,...,y_n \in [-2^{n-1},2^{n-1}] such that \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in…

Classical Analysis and ODEs · Mathematics 2010-03-30 Apoloniusz Tyszka

For positive integers $m$ we consider the theta functions $f_m(z):=\sum_{mk+1\text{ square }}q^k$. Due to classical identities of Jacobi, it is known that $$f_4\equiv f_6f_{12}\pmod 2.$$ Here we prove that the only triples $(a,b,c)$ for…

Number Theory · Mathematics 2021-06-03 Letong Hong , Shengtong Zhang

Characterizing whether a Markov process of discrete random variables has an homogeneous continuous-time realization is a hard problem. In practice, this problem reduces to deciding when a given Markov matrix can be written as the…

Probability · Mathematics 2021-06-23 Marta Casanellas , Jesús Fernández-Sánchez , Jordi Roca-Lacostena

For $n=1,2,3,\ldots$ let $S_n$ be the sum of the first $n$ primes. We mainly show that the sequence $a_n=\root n\of{S_n/n}\ (n=1,2,3,\ldots)$ is strictly decreasing, and moreover the sequence $a_{n+1}/a_n\ (n=10,11,\ldots)$ is strictly…

Number Theory · Mathematics 2013-11-01 Zhi-Wei Sun

We consider extended $1$-perfect codes in Hamming graphs $H(n,q)$. Such nontrivial codes are known only when $n=2^k$, $k\geq 1$, $q=2$, or $n=q+2$, $q=2^m$, $m\geq 1$. Recently, Bespalov proved nonexistence of extended $1$-perfect codes for…

Combinatorics · Mathematics 2025-03-24 Konstantin Vorob'ev

I want to show one possibility to proof the Collatz conjecture, also called 3n+1 conjecture, for any natural number N. For this, I limit my analysis on the direct odd follower of every natural odd number and show the connections between the…

General Mathematics · Mathematics 2013-03-14 Carolin Zöbelein

In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0,…

Number Theory · Mathematics 2009-01-29 Zhi-Wei Sun

We prove Marchenko-type uniqueness theorems for inverse Sturm-Liouville problems. Moreover, we prove a generalization of Ambarzumyans theorem.

Spectral Theory · Mathematics 2017-09-04 Yuri Ashrafyan

We prove that the ratio of the Newman sum over numbers multiple of a fixed integer which is not multiple of 3 and the Newman sum over numbers multiple of a fixed integer divisible by 3 is o(1) when the upper limit of summing tends to…

Number Theory · Mathematics 2008-08-20 Vladimir Shevelev

Recently, Andrews and Bachraoui investigated congruences for certain restricted two-color partitions. They made two conjectures for Ramanujan type congruences and a vanishing identity for the limiting sequence. Very recently, Banerjee,…

Number Theory · Mathematics 2026-04-08 Junjie Sun , Olivia X. M. Yao

Let A,B be matrices in SL(2,R) having trace greater than or equal to 2. Assume the pair A,B is coherently oriented, that is, can be conjugated to a pair having nonnegative entries. Assume also that either A,B^(-1) is coherently oriented as…

Dynamical Systems · Mathematics 2021-08-11 Giovanni Panti , Davide Sclosa

Let ${\rm rad}(n)$ denote the product of distinct prime factors of an integer $n\geq 1$. The celebrated $abc$ conjecture asks whether every solution to the equation $a+b=c$ in triples of coprime integers $(a,b,c)$ must satisfy ${\rm…

Number Theory · Mathematics 2025-05-21 Jared Duker Lichtman

We prove a new theorem relating the number of distinct eigenvalues of a matrix after perturbation to the prior number of distinct eigenvalues, the rank of the update, and the degree of nondiagonalizability of the matrix. In particular, a…

Optimization and Control · Mathematics 2016-03-10 Patrick E. Farrell