Related papers: Symmetric Word Equations in Two Positive Definite …
We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…
We define a new average - termed the resolvent average - for positive semidefinite matrices. For positive definite matrices, the resolvent average enjoys self-duality and it interpolates between the harmonic and the arithmetic averages,…
We solve the word problem for free double categories without equations between generators by translating it to the word problem for 2-categories. This yields a quadratic algorithm deciding the equality of diagrams in a free double category.…
We consider the generalized continuous-time Lyapunov equation: $$ A^*XB + B^*XA =-Q, $$ where $Q$ is an $N\times N$ Hermitian positive definite matrix and $A,B$ are arbitrary $N\times N$ matrices. Under some conditions, using the coupled…
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…
We prove that if two finite metacyclic groups have isomorphic rational group algebras, then they are isomorphic. This contributes to understand where is the line separating positive and negative solutions to the Isomorphism Problem for…
We consider word maps and word maps with constants on a simple algebraic group. We present results on the images of such maps, in particular, we prove a theorem on the dominance of general word maps with constants, which can be viewed as an…
We show that the equality language of two non-periodic binary morphisms is generated by at most two words. If its rank is two, then the generators start (and end) with different letters. This in particular implies that any binary language…
An ideal of polynomials is symmetric if it is closed under permutations of variables. We relate general symmetric ideals to the so called Specht ideals generated by all Specht polynomials of a given shape. We show a connection between the…
Word equations are a crucial element in the theoretical foundation of constraint solving over strings, which have received a lot of attention in recent years. A word equation relates two words over string variables and constants. Its…
Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables and constants. Its solution amounts to a function mapping variables to constant…
In this article, we propose an idea to develop some sufficient conditions for the existence and uniqueness of a positive definite common solution to a pair of non-linear matrix equations. To proceed this, we present some interesting common…
A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $A = BB^T$. We characterize the interior of the CP cone. A semidefinite algorithm is proposed for checking interiors of the CP…
One form of the inclusion-exclusion principle asserts that if A and B are functions of finite sets then A(S) is the sum of B(T) over all subsets T of S if and only if B(S) is the sum of (-1)^|S-T| A(T) over all subsets T of S. If we replace…
In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…
Let M be an archimedean quadratic module of real t-by-t matrix polynomials in n variables, and let S be the set of all real n-tuples where each element of M is positive semidefinite. Our key finding is a natural bijection between the set of…
This is a revised form of the previous paper in which we study cones of positive maps of B(H) into itself. We add the result that the dual cone of a symmetric mapping cone is itself a symmetric mapping cone. As applications we obtain…
We analyze how symmetries can be used to compress structures (also known as interpretations) onto a smaller domain without loss of information. This analysis suggests the possibility to solve satisfiability problems in the compressed domain…
A finite word $f$ is Hamming-isometric if for any two word $u$ and $v$ of same length avoiding $f$, $u$ can be transformed into $v$ by changing one by one all the letters on which $u$ differs from $v$, in such a way that all of the new…
In recent research on non-monotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P union R and Q union R have the same answer sets for any other program R. This…