Related papers: Algorithmic detectability of iwip automorphisms

We prove that every $2$-local automorphism on a finite-dimensional semi-simple Lie algebra $\mathcal{L}$ over an algebraically closed field of characteristic zero is an automorphism. We also show that each finite-dimensional nilpotent Lie…

Combining two results from machine learning theory we prove that a formula is NIP if and only if it satisfies uniform definability of types over finite sets (UDTFS). This settles a conjecture of Laskowski.

In this work, we establish a relationship between the sum of irreducible character degrees and the number of twisted involutions associated with the automorphisms of a finite group. We develop algorithmic frameworks for evaluating these…

Let $R$ be a ring of prime characteristic $p$, and let $F^e_* R$ denote $R$ viewed as an $R$-module via the $e$th iterated Frobenius map. Given a surjective map $\phi : F^e_* R \to R$ (for example a Frobenius splitting), we exhibit an…

Non-negative Matrix Factorization (NMF) asks to decompose a (entry-wise) non-negative matrix into the product of two smaller-sized nonnegative matrices, which has been shown intractable in general. In order to overcome this issue, the…

An affine model of computation is defined as a subset of iterated immediate-snapshot runs, capturing a wide variety of shared-memory systems, such as wait-freedom, t-resilience, k-concurrency, and fair shared-memory adversaries. The…

It is proved that if a finite $p$-soluble group $G$ admits an automorphism $\varphi$ of order $p^n$ having at most $m$ fixed points on every $\varphi$-invariant elementary abelian $p'$-section of $G$, then the $p$-length of $G$ is bounded…

We investigate some situation in which automorphisms of a group G are uniquely determined by their restrictions to a proper subgroup H. Much of the paper is devoted to studying under which additional hypotheses this property forces G to be…

We give elementary proofs of the following two theorems on automorphisms of a finite group G: (1) An automorphism of G is inner if and only if it extends to an automorphism of every finite group containing G. (2) There exists a finite…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

We propose a filtering feature selection framework that considers subsets of features as paths in a graph, where a node is a feature and an edge indicates pairwise (customizable) relations among features, dealing with relevance and…

Parameter identifiability is a structural property of an ODE model for recovering the values of parameters from the data (i.e., from the input and output variables). This property is a prerequisite for meaningful parameter identification in…

We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on the eigenvector, or several eigenvectors (or their corresponding invariant subspace). The algorithms are derived from an implicit…

We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As…

Let $FI(X,K)$ be the finitary incidence algebra of a non-connected partially ordered set $X$ over a field $K$ of characteristic different from $2$. For the case where every multiplicative automorphism of $FI(X,K)$ is inner, we present…

We describe an algorithm which determines whether or not a group which is hyperbolic relative to abelian groups admits a nontrivial splitting over a finite group.

We classify abelian subgroups of Out(F_n) up to finite index in an algorithmic and computationally friendly way. A process called disintegration is used to canonically decompose a single rotationless element \phi into a composition of…

A long-standing conjecture asserts that every finite non-abelian $p$-group has a non-inner automorphism of order $p$. In this paper, we settle the conjecture for a finite $p$-group ($p >2$) of nilpotency class $n$ with certain conditions.

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

Suppose that $\chi_\lambda$ and $\chi_\mu$ are distinct irreducible characters of the symmetric group $S_n$. We give an algorithm that, in time polynomial in $n$, constructs $\pi\in S_n$ such that $\chi_\lambda(\pi)$ is provably different…