Related papers: Refined class number formulas and Kolyvagin system…
This article deals with a conjecture, introduced in [GQ] (hereinafter $SFLT2$), which generalizes the second case of Fermat's Last Theorem: {\it Let $p>3$ be a prime. The diophantine equation $\frac{u^p+v^p}{u+v}=w_1^p$ with $u,v,u+v,…
Zeilberger proved the Refined Alternating Sign Matrix Theorem, which gives a product formula, first conjectured by Mills, Robbins and Rumsey, for the number of alternating sign matrices with given top row. Stroganov proved an explicit…
Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…
Let p$\ge$2 be a given prime number. We prove, for any number field kappa and any integer e$\ge$1, the p-rank $\epsilon$-conjecture, on the p-class groups Cl\_F, for the family F\_kappa^p^e of towers F/kappa built as successive degree p…
We show that under the proper forcing axiom the class of all Aronszajn lines behave like $\sigma$-scattered orders under the embeddability relation. In particular, we are able to show that the class of better quasi order labeled fragmented…
Consider the set of all natural numbers that are co-prime to primes less than or equal to a given prime. Then given a consecutive pair of numbers in that set with an arbitrary even gap, we prove there exists an unbounded number of actual…
Main theorem of [Buyukboduk, arXiv:0706.0377v1] suggests that it should be possible to lift the Kolyvagin systems of Stark units constructed in [Buyukboduk, arXiv:math/0703426v1] to a Kolyvagin system over the cyclotomic Iwasawa algebra.…
Markov numbers are integers that appear in the solution triples of the Diophantine equation, $x^2+y^2+z^2=3xyz$, called the Markov equation. A classical topic in number theory, these numbers are related to many areas of mathematics such as…
Let $b$ be an integer greater than or equal to $2$. For any integer $n\in \left[b^{\lambda-1}, b^{\lambda}-1\right]$, we denote by $R_\lambda (n)$ the reverse of $n$ in base $b$, obtained by reversing the order of the digits of $n$. We…
For an algebraic number $\alpha$ we consider the orders of the reductions of $\alpha$ in finite fields. In the case where $\alpha$ is an integer, it is known by the work on Artin's primitive root conjecture that the order is "almost always…
We prove a noncommutative variant of Saskin's classical theorem -- on the connection between Choquet boundaries for function spaces and Korovkin sets -- for operator systems generating separable Type I C*-algebras. The main result implies…
For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
Let $E/\mathbb{Q}$ be an elliptic curve of level $N$ and rank equal to $1$. Let $p$ be a prime of ordinary reduction. We experimentally study conjecture $4$ of B. Mazur and J. Tate in his article "Refined Conjectures of the Birch and…
Under sufficiently strong assumptions about the first term in an arithmetic progression, we prove that for any integer $a$, there are infinitely many $n\in \mathbb N$ such that for each prime factor $p|n$, we have $p-a|n-a$. This can be…
We introduce a machine free mathematical framework to get a natural formalization of some general notions of infinite computation in the context of Kolmogorov complexity. Namely, the classes Max^{X\to D}_{PR} and Max^{X\to D}_{Rec} of…
In this paper we prove the Gromov--Milman conjecture (the Dvoretzky type theorem) for homogeneous polynomials on $\mathbb R^n$, and improve bounds on the number $n(d,k)$ in the analogous conjecture for odd degrees $d$ (this case is known as…
We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…
The main purpose of this paper is to find all the prime numbers p for which whenever we add to p an odd square less than p we obtain a number which has at most two different prime factors. We solve completely the cases $p\equiv 1,3,5 \pmod…
We present a general theorem characterizing the relationship between the prime base $p$ representations of non-negative integers $x$ and their positive integer powers, $x^n$. For any positive integer $l$, the theorem establishes the…