English
Related papers

Related papers: Equations over free inverse monoids with idempoten…

200 papers

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

Number Theory · Mathematics 2008-11-26 Xiang-dong Hou , Gary L. Mullen

We consider parametrized systems of generalized polynomial equations (with real exponents) in $n$ positive variables, involving $m$ monomials with positive parameters; that is, $x\in\mathbb{R}^n_>$ such that ${A \, (c \circ x^B)=0}$ with…

Algebraic Geometry · Mathematics 2026-05-29 Abhishek Deshpande , Stefan Müller

A Dirichlet-type problem is studied for an equation of even order with variable coefficients. A criterion for the uniqueness of a solution is given. The solution is built in the form of a Fourier series. When justifying the convergence of…

Analysis of PDEs · Mathematics 2021-06-01 B. Irgashev

We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…

Optimization and Control · Mathematics 2026-01-27 Yan Dolinsky , Or Zuk

Criteria are given for determining whether an irreducible sextic equation with rational coefficients is algebraically solvable over the complex numbers.

Mathematical Physics · Physics 2007-05-23 C. Boswell , M. L. Glasser

We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…

Logic in Computer Science · Computer Science 2007-05-23 Sabine Glesner , Karl Stroetmann

Motivated by its applications to the word problem for one-relator inverse monoids, via results of Ivanov, Margolis, and Meakin (2001), we prove several decidability and undecidability results about the submonoid membership problem in…

Group Theory · Mathematics 2025-09-30 Islam Foniqi , Robert D. Gray

Valuation based systems verifying an idempotent property are studied. A partial order is defined between the valuations giving them a lattice structure. Then, two different strategies are introduced to represent valuations: as infimum of…

Artificial Intelligence · Computer Science 2013-02-08 Luis D. Hernandez , Serafin Moral

With each semigroup one can associate a partial algebra, called the biordered set, which captures important algebraic and geometric features of the structure of idempotents of that semigroup. For a biordered set $\mathcal{E}$, one can…

Group Theory · Mathematics 2022-10-07 Igor Dolinka

We show that every finite inverse monoid has an idempotent-separating cover by a finite F-inverse monoid. This provides a positive answer to a conjecture of Henckell and Rhodes.

Group Theory · Mathematics 2018-08-16 Julian Bitterlich

We prove that the electromagnetic material parameters are uniquely determined by boundary measurements for the time-harmonic Maxwell equations in certain anisotropic settings. We give a uniqueness result in the inverse problem for Maxwell…

Analysis of PDEs · Mathematics 2019-12-19 Carlos E. Kenig , Mikko Salo , Gunther Uhlmann

The known facts about solvability of equations over groups are considered from a more general point of view. A generalized version of the theorem about solvability of unimodular equations over torsion-free groups is proved. In a special…

Group Theory · Mathematics 2007-05-23 Anton A. Klyachko

We study the precise computational complexity of deciding satisfiability of first-order quantified formulas over the theory of fixed-size bit-vectors with binary-encoded bit-widths and constants. This problem is known to be in EXPSPACE and…

Logic in Computer Science · Computer Science 2018-05-03 Martin Jonáš , Jan Strejček

We investigate the class of regular-ordered word equations. In such equations, each variable occurs at most once in each side and the order of the variables occurring in both sides is the preserved (the variables can be, however, separated…

Formal Languages and Automata Theory · Computer Science 2017-03-01 Joel D. Day , Florin Manea , Dirk Nowotka

We establish coNExpTime-completeness of the problem of deciding order-invariance of a given two variable first-order formula, improving and significantly simplifying coTwoNExpTime bound by Zeume and Harwath.

Logic in Computer Science · Computer Science 2022-08-17 Bartosz Bednarczyk

We study the satisfiability problem for the two-variable first-order logic over structures with one transitive relation. % We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential…

Logic in Computer Science · Computer Science 2019-04-10 Wiesław Szwast , Lidia Tendera

It is proved that the periodic point submonoid of a free inverse monoid endomorphism is always finitely generated. Using Chomsky's hierarchy of languages, we prove that the fixed point submonoid of an endomorphism of a free inverse monoid…

Group Theory · Mathematics 2014-02-07 Emanuele Rodaro , Pedro V. Silva

It is shown that a finite monoid can have an infinite irredundant basis of equations.

Logic · Mathematics 2015-11-20 Marcel Jackson

A complete solution to the multiplier version of the inverse problem of the calculus of variations is given for a class of hyperbolic systems of second-order partial differential equations in two independent variables. The necessary and…

Differential Geometry · Mathematics 2009-10-16 Matt Biesecker

We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints. The atomic formulas over this language are equality…

Logic in Computer Science · Computer Science 2013-06-26 Vijay Ganesh , Mia Minnes , Armando Solar-Lezama , Martin Rinard