Related papers: Detecting fully irreducible automorphisms: a polyn…
Given two graphs $H$ and $G$, the Subgraph Isomorphism problem asks if $H$ is isomorphic to a subgraph of $G$. While NP-hard in general, algorithms exist for various parameterized versions of the problem: for example, the problem can be…
We study the complexity of reductions for weighted reachability in parametric Markov decision processes. That is, we say a state p is never worse than q if for all valuations of the polynomial indeterminates it is the case that the maximal…
In the context of dynamical systems, nonlinearity measures quantify the strength of nonlinearity by means of the distance of their input-output behaviour to a set of linear input-output mappings. In this paper, we establish a framework to…
Two graphs $G$ and $H$ are homomorphism indistinguishable over a family of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphism from $F$ to $H$. Many…
In the classic Maximum Weight Independent Set problem we are given a graph $G$ with a nonnegative weight function on vertices, and the goal is to find an independent set in $G$ of maximum possible weight. While the problem is NP-hard in…
We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…
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…
In the Multiagent Path Finding problem (MAPF for short), we focus on efficiently finding non-colliding paths for a set of $k$ agents on a given graph $G$, where each agent seeks a path from its source vertex to a target. An important…
We study those fully irreducible outer automorphisms phi of a finite rank free group F_r which are ``parageometric'', meaning that the attracting fixed point of phi in the boundary of outer space is a geometric R-tree with respect to the…
Every rotationless outer automorphism of a finite rank free group is represented by a particularly useful relative train track map called a CT. The main result of this paper is that the constructions of CTs can be made algorithmic. A key…
Let $S_0$ be a smooth and compact real variety given by a reduced regular sequence of polynomials $f_1, ..., f_p$. This paper is devoted to the algorithmic problem of finding {\em efficiently} a representative point for each connected…
A fully irreducible outer automorphism phi of the free group F_n of rank n has an expansion factor which often differs from the expansion factor of the inverse of phi. Nevertheless, we prove that the ratio between the logarithms of the…
A deep neural network using rectified linear units represents a continuous piecewise linear (CPWL) function and vice versa. Recent results in the literature estimated that the number of neurons needed to exactly represent any CPWL function…
Let k be a field of characteristic zero. Let phi be a k-endomorphism of the polynomial algebra k[x_1,...,x_n]. It is known that phi is an automorphism if and only if it maps irreducible polynomials to irreducible polynomials. In this paper…
We consider the numerical irreducible decomposition of a positive dimensional solution set of a polynomial system into irreducible factors. Path tracking techniques computing loops around singularities connect points on the same irreducible…
The paper provides results regarding the computational complexity of hybrid system identification. More precisely, we focus on the estimation of piecewise affine (PWA) maps from input-output data and analyze the complexity of computing a…
We prove that if F is a finitely generated free group and f:F -> F is an automorphism with polynomial growth of degree d, then there exists a characteristic subgroup S < F of finite index such that the induced automorphism of the…
We propose and justify a new approach to constructing optimal nonlinear transforms of random vectors. We show that the proposed transform improves such characteristics of rank-reduced transforms as compression ratio, accuracy of…
An irreducible element of a commutative ring is absolutely irreducible if no power of it has more than one (essentially different) factorization into irreducibles. In the case of the ring $\text{Int}(D)=\{f\in K[x]\mid f(D)\subseteq D\}$,…
We present a polynomial-time pseudo-deterministic algorithm for constructing irreducible polynomial of degree $d$ over finite field $\mathbb{F}_q$. A pseudo-deterministic algorithm is allowed to use randomness, but with high probability it…