Related papers: Algorithmic detectability of iwip automorphisms

Let $\mathcal{F}$ denote a singular holomorphic foliation on $\mathbb{P}^2$ having a finite automorphism group $\mbox{aut}(\mathcal{F})$. Fixed the degree of $\mathcal{F}$, we determine the maximal value that $|\mbox{aut}(\mathcal{F})|$ can…

If an automorphism f of a structure M is such that fix(f^k) = fix(f) for all positive k, then M|fix(f) is a substructure of M. The possible isomorphism types of such M|fix(f) are characterized when M is countable and arithmetically…

This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.

Full Waveform Inversion (FWI) is a standard algorithm in seismic imaging. Its implementation requires the a priori choice of a number of "design parameters", such as the positions of sensors for the actual measurements and one (or more)…

We give an algorithm to decide whether an algebraic plane foliation F has a rational first integral and to compute it in the affirmative case. The algorithm runs whenever we assume the polyhedrality of the cone of curves of the surface…

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

We prove that every automorphism of an infinite-dimensional vector space over a field is the product of four involutions, a result that is optimal in the general case. We also characterize the automorphisms that are the product of three…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

Let E be a division ring and G a finite group of automorphisms of E whose elements are distinct modulo inner automorphisms of E. Given a representation \rho: B-> GL(d,E) of an F-algebra B, we give necessary and sufficient conditions for…

Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local…

We classify and construct irreducible completely splittable representations of affine and finite Hecke-Clifford algebras over an algebraically closed field of characteristic not equal to 2.

A surface automorphism is strongly irreducible if every essential simple closed curve in the surface has nontrivial geometric intersection with its image. We show that a three-manifold admits only finitely many inequivalent surface bundle…

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

This paper is devoted to study local automorphisms of $p$-filiform Leibniz algebras. We prove that $p$-filiform Leibniz algebras as a rule admit local automorphisms which are not automorphisms.

Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…

We show that for two afii varieties over an arbitrary field of characteristic zero, there is no general form of an algorithm for checking the presence of an embedding of one algebraic variety in another. Moreover, we establish this for…

Let $f(x)$ be a non-zero polynomial with integer coefficients. An automorphism $\varphi$ of a group $G$ is said to satisfy the elementary abelian identity $f(x)$ if the linear transformation induced by $\varphi$ on every characteristic…

The Recognizability Theorem states that if a set of finite graphs is definable by a monadic second-order (MSO) sentence, then it is recognizable with respect to the graph algebra upon which the definition of clique-width is based.…

We prove the undecidability of determining whether a Turing machine yields an eventually periodic trajectory. From this, we deduce the undecidability of orbit finiteness in the polynomial dynamical system on infinite tuples of integers.

This paper considers the problem of fault detection and isolation (FDI) for switched affine models. We first study the model invalidation problem and its application to guaranteed fault detection. Novel and intuitive optimization-based…