English
Related papers

Related papers: One-variable equations over the lamplighter group

200 papers

We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…

Logic in Computer Science · Computer Science 2024-04-05 Michael Benedikt , Egor V. Kostylev , Tony Tan

We present a new geometric construction of Loewner chains in one and several complex variables which holds on a complete hyperbolic complex manifold M and prove that there is essentially a one-to-one correspondence between evolution…

Complex Variables · Mathematics 2011-09-01 Leandro Arosio , Filippo Bracci , Hidetaka Hamada , Gabriela Kohr

In this paper, we study Diophantine exponents $w_n$ and $w_n ^{*}$ for Laurent series over a finite field. Especially, we deal with the case $n=2$, that is, quadratic approximation. We first show that the range of the function $w_2-w_2…

Number Theory · Mathematics 2017-03-23 Tomohiro Ooto

These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…

Number Theory · Mathematics 2010-03-17 Michael Stoll

We study in this paper the continuous and discrete Euler-Lagrange equations arising from a quadratic lagrangian. Those equations may be thought as numerical schemes and may be solved through a matrix based framework. When the lagrangian is…

Optimization and Control · Mathematics 2011-06-28 Philippe Ryckelynck , Laurent Smoch

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition…

Number Theory · Mathematics 2015-09-07 Shuntaro Yamagishi

Let $p$ be a prime integer, $\mathbb{Z}_p$ the finite field of order $p$ and $\mathbb{Z}^{*}_{p}$ is its multiplicative cyclic group. We consider the Diophantine equation $x^n + y^n = z^n$ with $1 \leq n \leq \frac{p - 1}{2}$. Our main aim…

Number Theory · Mathematics 2020-01-10 Silvia R. Valdes , Yelena Shvets

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

Group Theory · Mathematics 2018-01-16 Samuel J. v. Gool , B. Steinberg

Reidemeister (or twisted conjugacy) classes are considered in restricted wreath products of the form $G\wr \mathbb{Z}^k$, where $G$ is a finite group. For an automorphism $\varphi$ of finite order (supposed to be the same for the torsion…

Group Theory · Mathematics 2023-05-23 Evgenij Troitsky

We consider positive solutions of a fractional Lane-Emden type problem in a bounded domain with Dirichlet conditions. We show that uniqueness and nondegeneracy hold for the asymptotically linear problem in general domains. Furthermore, we…

Analysis of PDEs · Mathematics 2022-07-25 Abdelrazek Dieb , Isabella Ianni , Alberto Saldaña

We show that the domino problem is undecidable on orbit graphs of non-deterministic substitutions which satisfy a technical property. As an application, we prove that the domino problem is undecidable for the fundamental group of any closed…

Group Theory · Mathematics 2020-05-07 Nathalie Aubrun , Sebastián Barbieri , Etienne Moutot

We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…

Rings and Algebras · Mathematics 2016-08-16 Tim Netzer , Andreas Thom

In this paper we show a way to generalize the linear Diophantine equation a1x1+a2x2+...+anxn=d . We deal with the nonlinear Diophantine equation det|A X|=+-d , which generalizes the linear one, and we give a necessary and sufficient…

Number Theory · Mathematics 2019-03-26 Massimo Salvi

The classical decision problem, as it is understood today, is the quest for a delineation between the decidable and the undecidable parts of first-order logic based on elegant syntactic criteria. In this paper, we treat the concept of…

Logic in Computer Science · Computer Science 2019-11-27 Marco Voigt

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 study the L^p-distortion of finite quotients of amenable groups. In particular, for every number p larger or equal than 2, we prove that the l^p-distortion of the finite lamplighter group grows like (\log n)^{1/p}. We also give the…

Metric Geometry · Mathematics 2007-10-31 Romain Tessera

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

alg-geom · Mathematics 2008-02-03 M. Giusti , J. Heintz , K. Hägele , J. E. Morais , L. M. Pardo , J. L. Montaña

This paper concerns elliptic systems of $p$-Laplace type with complex valued coefficient and source term. We extend the real valued theory of the elliptic $p$-Laplace equation to the complex valued case. We establish the existence and…

Analysis of PDEs · Mathematics 2025-03-25 Wontae Kim , Matias Vestberg

We propose and investigate a bi-infinite matrix approach to the multiplication and composition of formal Laurent series. We generalize the concept of Riordan matrix to this bi-infinite context, obtaining matrices that are not necessarily…

Group Theory · Mathematics 2025-04-11 Luis Felipe Prieto-Martínez , Javier Rico

The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitrarily close to 1? This problem was proved undecidable recently.…

Formal Languages and Automata Theory · Computer Science 2012-01-27 Nathanaël Fijalkow , Hugo Gimbert , Youssouf Oualhadj