English
Related papers

Related papers: 2-Variable Frobenius Problem in Z[\sqrt M]

200 papers

Two elementary formulae for Mertens function $M(n)$ are obtained. With these formulae, $M(n)$ can be calculated directly and simply, which can be easily implemented by computer. $M (1) \sim M (2 \times 10^7) $ are calculated one by one.…

Number Theory · Mathematics 2016-12-16 Rong Qiang Wei

Quadratic irrationals posses a periodic continued fraction expansion. Much less is known about cubic irrationals. We do not even know if the partial quotients are bounded, even though extensive computations suggest they might follow…

Number Theory · Mathematics 2011-08-02 Mitja Lakner , Peter Petek , Marjeta Škapin Rugelj

We are concerned with the tensor equations whose coefficient tensor is an M-tensor. We first propose a Newton method for solving the equation with a positive constant term and establish its global and quadratic convergence. Then we extend…

Optimization and Control · Mathematics 2021-01-28 Dong-Hui Li Jie-Feng Xu , Hong-Bo Guan

If $m \in \mathbb{N}$ and $A$ is a finite subset of $\bigcup_{k \in \mathbb{N} \setminus \{0,1\}} \{1,\ldots,m-1\}^k$, then we denote by \begin{align*} \mathscr{C}(m,A) = \left\{S\in \mathscr{S}_m \mid s_1+\cdots+s_k-m \in S \mbox{ if }…

Group Theory · Mathematics 2023-01-09 Aureliano M. Robles-Pérez , José Carlos Rosales

Let f be a square-free polynomial in Fq[t][x] where Fq is a field of q elements. We view f as a polynomial in the variable x with coefficients in the ring Fq[t]. We study squarefree values of f in sparse subsets of Fq[t] which are given by…

Number Theory · Mathematics 2015-03-04 Shai Rosenberg

In this paper in the space $L_2^{(m)}(0,1)$ the problem of construction of optimal quadrature formulas is considered. Here the quadrature sum consists on values of integrand at nodes and values of first derivative of integrand at the end…

Numerical Analysis · Mathematics 2008-12-12 Kh. M. Shadimetov , A. R. Hayotov , F. A. Nuraliev

We prove that for every positive integer $m$, there exist infinitely many simple abelian varieties over $\mathbb{F}_2$ of order $m$. The method is constructive, building on the work of Madan--Pal in the case $m=1$ to produce an explicit…

Number Theory · Mathematics 2022-08-09 Kiran S. Kedlaya

We compute the Frobenius complexity for the determinantal ring of prime characteristic $p$ obtained by modding out the $2 \times 2$ minors of an $m \times n$ matrix of indeterminates, where $m > n \ge 2$. We also show that, as $p \to…

Commutative Algebra · Mathematics 2015-10-15 Florian Enescu , Yongwei Yao

We continue the development of $\mathbb{Z}^n_2$-supergeometry, a natural generalization of classical ($\mathbb{Z}_2$-graded) supergeometry, by proving the Frobenius theorem for integrable distributions on differentiable…

Differential Geometry · Mathematics 2016-08-03 Tiffany Covolo , Stephen Kwok , Norbert Poncin

Given positive integers $a_1,...,a_n$ with $\gcd(a_1,...,a_n) = 1$, we call an integer t representable if there exist nonnegative integers $m_1,...,m_n$ such that $t = m_1 a_1 + ... + m_n a_n$. In this paper, we discuss the linear…

Number Theory · Mathematics 2007-05-23 Matthias Beck , Sinai Robins

An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms \[ \begin{cases} F = c_{1}x_1^3 + c_{2}x_2^3 + \cdots + c_{n}x_n^3 = 0, \\ G = d_{1}x_1^3 + d_{2}x_2^3 + \cdots + d_{n}x_n^3 =…

Number Theory · Mathematics 2026-02-24 Yixiu Xiao , Hongze Li

We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…

Number Theory · Mathematics 2015-10-19 Geoffrey B. Campbell , Aleksander Zujev

Let $\Sigma=\{a_1, \ldots , a_n\}$ be a set of positive integers with $a_1 < \ldots < a_n$ such that all $2^n$ subset sums are pairwise distinct. A famous conjecture of Erd\H{o}s states that $a_n>C\cdot 2^n$ for some constant $C$, while the…

Combinatorics · Mathematics 2024-02-02 Simone Costa , Stefano Della Fiore , Andrea Ferraguti

A Hilbert space in M dimensions is shown explicitly to accommodate representations that reflect the prime numbers decomposition of M. Representations that exhibit the factorization of M into two relatively prime numbers: the kq…

Quantum Physics · Physics 2009-11-11 M. Revzen , F. C. Khanna , A. Mann , J. Zak

A square-free integer is a positive integer that is not divisible by the square of any prime. Merten's function, $M(x)$ is defined as the difference between the number of square free integers with an even number of prime factors and the…

Number Theory · Mathematics 2018-05-02 Irfan Okay

Given an integer n>1, it is a classical Diophantine problem that whether n can be written as a sum of two rational cubes. The study of this problem, considering several special cases of n, has a copious history that can be traced back to…

Number Theory · Mathematics 2022-12-01 Dipramit Majumdar , Pratiksha Shingavekar

A positive square-free integer is called a \textit{congruent number} if it arises as the area of a right triangle with rational side lengths. Let $ n = p_1p_2 \cdots p_t q $ be a square-free integer, where each $ p_i \equiv 1 \pmod{8} $ and…

Number Theory · Mathematics 2026-04-28 Shamik Das , Sudipa Mondal

Let f be a newform of weight at least 2 and squarefree level with Fourier coefficients in a number field K. We give explicit bounds, depending on congruences of f with other newforms, on the set of primes lambda of K for which the…

Number Theory · Mathematics 2007-05-23 Tom Weston

In this paper we use the theory of modular forms to find formulas for the number of representations of a positive integer by certain class of quadratic forms in eight variables, viz., forms of the form $a_1x_1^2 + a_2 x_2^2 + a_3 x_3^2 +…

Number Theory · Mathematics 2016-07-19 B. Ramakrishnan , Brundaban Sahu , Anup Kumar Singh

We consider the ternary Goldbach problem with two prime variables of the form $k^2+m^2+1$ and find an asymptotic formula for the number of its solutions.

Number Theory · Mathematics 2009-04-23 Doychin Tolev