English
Related papers

Related papers: More Than 1700 Years of Word Equations

200 papers

The boundedness of stable solutions to semilinear (or reaction-diffusion) elliptic PDEs has been studied since the 1970's. In dimensions 10 and higher, there exist stable energy solutions which are unbounded (or singular). This note…

Analysis of PDEs · Mathematics 2021-12-16 Xavier Cabre

We revisit the question of classification of balanced circular words and focus on the case of a ternary alphabet. We propose a $3$-dimensional generalisation of the discrete approximation representation of Christoffel words. By considering…

Combinatorics · Mathematics 2021-05-03 D. V. Bulgakova , N. Buzhinsky , Y. O. Goncharov

A number of elite thinkers in Europe during the 16th and 17th centuries pursued an agenda which historian Paolo Rossi calls the "quest for a universal language," a quest which was deeply interwoven with the emergence of the scientific…

History and Philosophy of Physics · Physics 2016-06-30 Gopal Sarma

In this paper, the elliptic curves theory is used for solving the Diophantine equations $\sum_{i=1}^n a_ix_{i} ^6+\sum_{i=1}^m b_iy_{i} ^3= \sum_{i=1}^na_iX_{i}^6\pm\sum_{i=1}^m b_iY_{i} ^3$, where $n$, $m$ $\geq 1$ and $a_i$, $b_i$, are…

Number Theory · Mathematics 2017-01-11 Farzali Izadi , Mehdi Baghalagdam

We present a general algorithm for solving all two-variable polynomial Diophantine equations consisting of three monomials. Before this work, even the existence of an algorithm for solving the one-parameter family of equations…

Number Theory · Mathematics 2023-07-07 Bogdan Grechuk , Tetiana Grechuk , Ashleigh Wilcox

Digital learning platforms enable students to learn on a flexible and individual schedule as well as providing instant feedback mechanisms. The field of STEM education requires students to solve numerous training exercises to grasp…

Computation and Language · Computer Science 2021-10-01 Stanley Uros Keller

Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…

Number Theory · Mathematics 2022-11-17 Konstantinos A. Draziotis

We deal with various Diophantine equations involving the Euler totient function and various sequences of numbers, including factorials, powers, and Fibonacci sequences.

Number Theory · Mathematics 2020-05-08 J. C. Saunders

We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) "Fibonacci-automatic". This class includes, for example, the famous Fibonacci word f = 01001010...,…

Formal Languages and Automata Theory · Computer Science 2014-07-29 Chen Fei Du , Hamoon Mousavi , Luke Schaeffer , Jeffrey Shallit

In this paper, we mainly answer a Lampe's question\cite{lampe} about the solutions of a Diophantine equation, that is, we give a criterion to determine which solutions of the Diophantine equation are in the orbit of the initial solution…

Number Theory · Mathematics 2025-08-05 Leizhen Bao , Fang Li

The study of finiteness or infiniteness of integer solutions of a Diophantine equation has been considered as a standard problem in the literature. In this paper, for f(x) in Z[x] monic and q1 ,...., qm in Z, we study the conditions for…

Number Theory · Mathematics 2019-02-12 S. Subburam , J. Tanti

We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely $\Sigma^1_2$-complete.…

Logic · Mathematics 2025-01-13 Jan Grebík , Zoltán Vidnyánszky

We introduce a topological approach to words. Words are approximated by Gauss words and then studied up to natural modifications inspired by homotopy transformations of curves on the plane.

Combinatorics · Mathematics 2007-05-23 Vladimir Turaev

Socratic questioning is an educational method that allows students to discover answers to complex problems by asking them a series of thoughtful questions. Generation of didactically sound questions is challenging, requiring understanding…

Computation and Language · Computer Science 2022-11-24 Kumar Shridhar , Jakub Macina , Mennatallah El-Assady , Tanmay Sinha , Manu Kapur , Mrinmaya Sachan

In this paper we provide criteria for the insolvability of the Diophantine equation $x^2+D=y^n$. This result is then used to determine the class number of the quadratic field $\mathbb{Q}(\sqrt{-D})$. We also determine some criteria for the…

Number Theory · Mathematics 2017-10-27 Azizul Hoque , Helen K. Saikia

We discuss a topological approach to words introduced by the author. Words on an arbitrary alphabet are approximated by Gauss words and then studied up to natural modifications inspired by the Reidemeister moves on knot diagrams. This leads…

Combinatorics · Mathematics 2007-05-23 Vladimir Turaev

We settle the equivalence between the problem of hitting a polyhedral set by the orbit of a linear map and the intersection of a regular language and a language of permutations of binary words (the permutation filter realizability problem).…

Formal Languages and Automata Theory · Computer Science 2010-12-07 S. Tarasov , M. Vyalyi

About thirty years ago we looked for "minimal assumptions" on the data which guarantee that solutions to the $\,2-D\,$ evolution Euler equations in a bounded domain are classical. Classical means here that all the derivatives appearing in…

Analysis of PDEs · Mathematics 2015-02-05 Hugo Beirao da Veiga

The art of mathematical reasoning stands as a fundamental pillar of intellectual progress and is a central catalyst in cultivating human ingenuity. Researchers have recently published a plethora of works centered around the task of solving…

Computation and Language · Computer Science 2023-06-27 Syed Rifat Raiyan , Md. Nafis Faiyaz , Shah Md. Jawad Kabir , Mohsinul Kabir , Hasan Mahmud , Md Kamrul Hasan

We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause…

cmp-lg · Computer Science 2016-08-31 Mary Dalrymple , Stuart M. Shieber , Fernando C. N. Pereira
‹ Prev 1 8 9 10 Next ›