Related papers: The commutativity problem for effective varieties …
We present, in the same vein as in [20] and [21], some results of the so-called "Smooth (or $\mathcal{C}^\infty$) Commutative Algebra", a version of Commutative Algebra of $\mathcal{C}^{\infty}-$rings instead of ordinary commutative unital…
We study enumeration problems for multi-operator monomials generated from one indeterminate by an associative multiplication together with finitely many unary operators. We consider four regimes, according to whether multiplication is…
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…
In the past, empirical evidence has been presented that Hilbert series of symplectic quotients of unitary representations obey a certain universal system of infinitely many constraints. Formal series with this property have been called…
We show how to use extended word series in the reduction of continuous and discrete dynamical systems to normal form and in the computation of formal invariants of motion in Hamiltonian systems. The manipulations required involve complex…
A rationally dynamically algebraic (RDA) power series is one that arises as (a component of) the solution of a system of differential equations of the form $\boldsymbol{y}' = F(\boldsymbol{y})$, where $F$ is a vector of rational functions…
This paper addresses the problem of checking invariant properties for a large class of symbolic transition systems, defined by a combination of SMT theories and quantifiers. State variables can be functions from an uninterpreted sort…
We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total…
Let $G$ be an abelian group of order $n$ and let $R$ be a commutative ring which admits a homomorphism ${\Bbb Z}[\zeta_{n}]\ra R$, where $\zeta_{n}$ is a (complex) primitive $n$-th root of unity. Given a finite $R[G\e]$-module $M$, we…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
A famous result due to I. M. Isaacs states that if a commutative ring $R$ has the property that every prime ideal is principal, then every ideal of $R$ is principal. This motivates ring theorists to study commutative rings for which every…
This article is written with the hope to draw attention to a method that uses integral transforms to find exact values for a large class of convergent series (and, in particular, series of rational terms). We apply the method to some series…
Let $G$ be a connected semisimple simply connected Lie group with a compact Cartan subgroup and let $\Gamma$ be a uniform lattice in $G$. Let $\widehat{G}_d$ denote the set of equivalence classes of unitary discrete series representations…
We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
Many decision problems concerning cellular automata are known to be decidable in the case of algebraic cellular automata, that is, when the state set has an algebraic structure and the automaton acts as a morphism. The most studied cases…
We consider applications of a finitary version of the Affine Representability theorem, which follows from recent work of Belov-Kanel, Rowen, and Vishne. Using this result we are able to show that when given a finite set of polynomial…
Quantum information science provides powerful technologies beyond the scope of classical physics. In practice, accurate control of quantum operations is a challenging task with current quantum devices. The implementation of high fidelity…
A group-word $w$ is concise in a class of groups $\mathcal X$ if and only if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G\in \mathcal X$. It is a long-standing open problem whether every…
The Homeomorphic Embedding relation has been amply used for defining termination criteria of symbolic methods for program analysis, transformation, and verification. However, homeomorphic embedding has never been investigated in the context…