English
Related papers

Related papers: Equations over free inverse monoids with idempoten…

200 papers

In this paper we provide concrete constructions of idempotents to represent typical singular matrices over a given ring as a product of idempotents and apply these factorizations for proving our main results. We generalize works due to…

Rings and Algebras · Mathematics 2013-02-05 Adel Alahmadi , Surender Jain , André Leroy

In this paper, we consider inverse scattering and inverse boundary value problems at sufficiently large and fixed energy for the multidimensional relativistic Newton equation with an external potential $V$, $V\in C^2$. Using known results,…

Mathematical Physics · Physics 2009-11-11 Alexandre Jollivet

In 1977, Makanin established the decidability of equations in free monoids. A key ingredient in his proof is the exponent of periodicity: for a word $w$, it is the largest exponent $e$ such that $w$ contains a nonempty factor of the form…

Group Theory · Mathematics 2026-04-08 Volker Diekert , Silas Natterer , Alexander Thumm

We show the existence of finitely presented torsion-free groups with decidable word problem that cannot be embedded in any finitely generated group with decidable conjugacy problem. This answers a well-known question of Collins from the…

Group Theory · Mathematics 2019-12-02 Arman Darbinyan

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

Discrete Mathematics · Computer Science 2023-09-12 Ruiwen Dong

We prove that the class of closed subgroups of free profinite monoids is precisely the class of projective profinite groups. In particular, the profinite groups associated to minimal symbolic dynamical systems by Almeida are projective. Our…

Group Theory · Mathematics 2014-02-26 John Rhodes , Benjamin Steinberg

We study initial value problems having dynamics ruled by discontinuous ordinary differential equations with the property of possessing a unique solution. We identify a precise class of such systems that we call solvable intitial value…

Computational Complexity · Computer Science 2024-05-03 Olivier Bournez , Riccardo Gozzi

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Optimization and Control · Mathematics 2023-10-02 Levent Tunçel , Stephen A. Vavasis , Jingye Xu

We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate…

Computational Complexity · Computer Science 2015-05-19 Jin-Yi Cai , Xi Chen , Richard Lipton , Pinyan Lu

This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…

Combinatorics · Mathematics 2009-05-28 David C. Haws

This paper is devoted to derive some necessary and suficient conditions for the existence of positive solutions to a singular second order system of dynamic equations with Dirichlet boundary conditions. The results are obtained by employing…

Classical Analysis and ODEs · Mathematics 2013-02-25 Ariadna Lago , Victoria Otero-Espinar , Tania Pernas-Castaño

Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. Complex systems with…

Numerical Analysis · Mathematics 2021-10-04 Owe Axelsson , Maeddeh Pourbagher , Davod Khojasteh Salkuyeh

The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…

Group Theory · Mathematics 2013-07-24 Hao Liang

Verification of properties of first order logic with two variables FO2 has been investigated in a number of contexts. Over arbitrary structures it is known to be decidable with NEXPTIME complexity, with finitely satisfiable formulas having…

Logic in Computer Science · Computer Science 2013-06-03 Saguy Benaim , Michael Benedikt , Rastislav Lenhardt , James Worrell

We develop a framework to give upper bounds on the "practical" computational complexity of stability problems for a wide range of nonlinear continuous and hybrid systems. To do so, we describe stability properties of dynamical systems using…

Systems and Control · Computer Science 2014-06-05 Sicun Gao , Soonho Kong , Edmund Clarke

We consider a Hamiltonian system of free boundary type, showing first uniform bounds and existence of solutions and of the free boundary. Then, for any smooth and bounded domain, we prove uniqueness of positive solutions in a suitable…

Analysis of PDEs · Mathematics 2025-08-05 Daniele Bartolucci , Yeyao Hu , Aleks Jevnikar , Juncheng Wei , Wen Yang

The authors [3] proved that the endomorphism semiring of a nontrivial semilattice is always subdirectly irreducible and described its monolith. Here we prove that the endomorphism semiring of a commutative inverse semigroup with at least…

Rings and Algebras · Mathematics 2020-09-18 M. K. Sen , S. K. Maity , Sumanta Das

In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually…

Commutative Algebra · Mathematics 2021-07-08 Vikramjeet Singh Chandel , Uma Dayal

An exact invariant is derived for $n$-degree-of-freedom Hamiltonian systems with general time-dependent potentials. The invariant is worked out in two equivalent ways. In the first approach, we define a special {\it Ansatz\/} for the…

Classical Physics · Physics 2023-03-23 Jürgen Struckmeier , Claus Riedel

We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded…

Computational Complexity · Computer Science 2011-11-10 Deepak Chermakani