Related papers: Detecting fully irreducible automorphisms: a polyn…

We study the loxodromic elements for the action of $Out(F_n)$ on the free splitting complex of the rank $n$ free group $F_n$. We prove that each outer automorphism is either loxodromic, or has bounded orbits without any periodic point, or…

Let $N \geq 2$ and let $\mathrm{Out}(F_N)$ be the outer automorphism group of a nonabelian free group of rank $N$. Let $\mathrm{IA}_N(\mathbb{Z}/3\mathbb{Z})$ be the finite index subgroup of $\mathrm{Out}(F_N)$ which is the kernel of the…

Let K[x,y] be the algebra of two-variable polynomials over a field K. A polynomial p=p(x, y) is called a test polynomial (for automorphisms) if, whenever \phi(p)=p for a mapping \phi of K[x,y], this \phi must be an automorphism. Here we…

Networks provide an informative, yet non-redundant description of complex systems only if links represent truly dyadic relationships that cannot be directly traced back to node-specific properties such as size, importance, or coordinates in…

Solving real-time quadratic programming (QP) is a ubiquitous task in control engineering, such as in model predictive control and control barrier function-based QP. In such real-time scenarios, certifying that the employed QP algorithm can…

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…

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…

We prove that abelian subgroups of the outer automorphism group of a free group are quasi-isometrically embedded. Our proof uses recent developments in the theory of train track maps by Feighn-Handel. As an application, we prove the rank…

The problem of lifting a preference order on a set of objects to a preference order on a family of subsets of this set is a fundamental problem with a wide variety of applications in AI. The process is often guided by axioms postulating…

One exact and two heuristic algorithms for determining the generators, orbits and order of the graph automorphism group are presented. A basic tool of these algorithms is the well-known individualization and refinement procedure. A search…

We investigate the problem $\#\mathsf{IndSub}(\Phi)$ of counting all induced subgraphs of size $k$ in a graph $G$ that satisfy a given property $\Phi$. This continues the work of Jerrum and Meeks who proved the problem to be…

Since many NP-complete graph problems have been shown polynomial-time solvable when restricted to claw-free graphs, we study the problem of determining the distance of a given graph to a claw-free graph, considering vertex elimination as…

Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\mathcal{F}$ if they admit the same number of homomorphisms from every graph $F \in \mathcal{F}$. Many graph isomorphism relaxations such as (quantum) isomorphism…

The finite element method is an indispensable tool in engineering, but its computational complexity prevents applications for control or at system-level. Model order reduction bridges this gap, creating highly efficient yet accurate…

Let $F_n$ be a free group of rank $n$. In this paper we discuss three algorithmic problems related to automorphisms of $F_2$. A word $u$ of $F_n$ is called positive if $u$ does not have negative exponents. A word $u$ in $F_n$ is called…

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…

A new characterization of Hamiltonian graphs using f-cutset matrix is proposed. Based on this new characterization, a new exact polynomial time algorithm for the traveling salesman problem (TSP) is developed. We then define the so-called…

This paper considers a natural fault-tolerant shortest paths problem: for some constant integer $f$, given a directed weighted graph with no negative cycles and two fixed vertices $s$ and $t$, compute (either explicitly or implicitly) for…

In \cite{KSS06} it was shown that with respect to the simple non-backtracking random walk on the free group $F_N=F(a_1,\dots,a_N)$ the Whitehead algorithm has strongly linear time generic-case complexity and that "generic" elements of $F_N$…

By the Pieri rule, the tensor product of an exterior power and a finite-dimensional irreducible representation of a general linear group has a multiplicity-free decomposition. The embeddings of the constituents are called Pieri inclusions…