Related papers: More Than 1700 Years of Word Equations
In this extended abstract we deal with the relations between the numerical/diophantine approximation and the symbolic/algebraic geometry approachs to solving of multivariate diophentine polynomial systems, obtaining several consecuences…
We survey classical and recent results on exponents of Diophantine approximation. We give only a few proofs and highlight several open problems.
Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…
Solving two-variable linear Diophantine equations has applications in many cryptographic protocols such as RSA and Elliptic curve cryptography. The Extended Euclid's algorithm is a well known algorithm to solve these equations. We revisit…
In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying the so-called factor complexity of infinite sequences, which…
The words of a language are randomly replaced in time by new ones, but it has long been known that words corresponding to some items (meanings) are less frequently replaced than others. Usually, the rate of replacement for a given item is…
The search of solutions of the Diophantine equation $x^3 + y^3 + z^3 = k$ for $k<1000$ has been extended with bounds of $|x|$, $|y|$ and $|z|$ up to $10^{15}$. The first solution for $k=74$ is reported. This only leaves $k=33$ and $k=42$…
A long-standing conjecture of Littlewood about simultaneous Diophantine approximation has an analogous problem for a field of formal Laurent series $\mathbb{F}(\!(t^{-1})\!)$. That is, we can ask whether for any series $\Theta$, $\Phi$ and…
Large language models (LLMs) have significantly transformed the educational landscape. As current plagiarism detection tools struggle to keep pace with LLMs' rapid advancements, the educational community faces the challenge of assessing…
Identifying mathematical relations expressed in text is essential to understanding a broad range of natural language text from election reports, to financial news, to sport commentaries to mathematical word problems. This paper focuses on…
Magic-square constraints define Diophantine systems whose solutions, in several natural families, exhibit rigid periodic structure. We study this structure in an oracle setting, where a marked set of integers is given by black-box access…
This work determine the entire family of positive integer solutions of the diophantine equation. The solution is described in terms of $\frac{(m-1)(m+n-2)}{2} $ or $\frac{(m-1)(m+n-1)}{2}$ positive parameters depending on $n$ even or odd.…
We show that a class of divergence-form elliptic problems with quadratic growth in the gradient and non-coercive zero order terms are solvable, under essentially optimal hypotheses on the coefficients in the equation. In addition, we prove…
The above equation is also called as Euler(6,2,5) system. By computational aspect these systems are very interesting. And we can also apply these methods to other Diophantine equations. We give a brief history of these systems and how we…
Science and mathematics help people better to understand world, eliminating different fallacies and misconceptions. One of such misconception is related to arithmetic, which is so important both for science and everyday life. People think…
Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are…
This paper reports on the current status of the project in which we order all polynomial Diophantine equations by an appropriate version of "size", and then solve the equations in that order. We list the "smallest" equations that are…
From the Rhind Papyrus and other extant sources, we know that the ancient Egyptians were very iterested in expressing a given fraction into a sum of unit fractions, that is fractions whose numerators are equal to 1. One of the problems that…
In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…
The study of Reynolds algebras has its origin in the well-known work of O. Reynolds on fluid dynamics in 1895 and has since found broad applications. It also has close relationship with important linear operators such as algebra…