Related papers: Detecting fully irreducible automorphisms: a polyn…

Let $K$ be a field and $P=K[x_1,\dots,x_n]$. The technique of elimination by substitution is based on discovering a coherently $Z=(z_1,\dots,z_s)$-separating tuple of polynomials $(f_1,\dots,f_s)$ in an ideal $I$, i.e., on finding…

We prove the following result about approximating the maximum independent set in a graph. Informally, we show that any approximation algorithm with a ``non-trivial'' approximation ratio (as a function of the number of vertices of the input…

Polytopic matrix factorization (PMF) is a recently introduced matrix decomposition method in which the data vectors are modeled as linear transformations of samples from a polytope. The successful recovery of the original factors in the…

Among (isotopy classes of) automorphisms of handlebodies those called irreducible (or generic) are the most interesting, analogues of pseudo-Anosov automorphisms of surfaces. We consider the problem of isotoping an irreducible automorphism…

The main result of this paper is an algorithmic answer to the question raised in the title, up to replacing the given $\hat{\phi} \in Out(F_n)$ by a positive power. In order to provide this algorithm, it is shown that every polynomially…

We introduce a concept of efficiency for which we can prove that it applies to all paddable languages, but still does not conflict with potential worst case intractability. Note that the family of paddable languages apparently includes all…

We present an efficient reinforcement learning algorithm that learns the optimal admission control policy in a partially observable queueing network. Specifically, only the arrival and departure times from the network are observable, and…

Given a free group of rank r >= 3 and two exponentially growing outer automorphisms {\psi} and {\phi} with dual lamination pairs {\Lambda^\pm}_{\psi} and {\Lambda^\pm}_{\phi} associated to them, which satisfy a notion of independence…

We consider the class non-surjective irreducible endomorphisms of the free group $F_n$. We show that such an endomorphism $\phi$ is topologically represented by a simplicial immersion $f:G \rightarrow G$ of a marked graph $G$; along the way…

In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree $n$ over a finite field and their roots in the extension field in quasilinear where $N=n^2$…

We revisit the recent polynomial-time algorithm for the MAX WEIGHT INDEPENDENT SET (MWIS) problem in bounded-degree graphs that do not contain a fixed graph whose every component is a subdivided claw as an induced subgraph [Abrishami,…

We prove that if $T$ is an $\mathbb R$-tree with a minimal free isometric action of $F_N$, then the $Out(F_N)$-stabilizer of the projective class $[T]$ is virtually cyclic. For the special case where $T=T_+(\phi)$ is the forward limit tree…

The lower and the upper irredundance numbers of a graph $G$, denoted $ir(G)$ and $IR(G)$ respectively, are conceptually linked to domination and independence numbers and have numerous relations to other graph parameters. It is a…

Considering the worst-case scenario, junction tree algorithm remains the most general solution for exact MAP inference with polynomial run-time guarantees. Unfortunately, its main tractability assumption requires the treewidth of a…

We present a sampling theory for a class of binary images with finite rate of innovation (FRI). Every image in our model is the restriction of $\mathds{1}_{\{p\leq0\}}$ to the image plane, where $\mathds{1}$ denotes the indicator function…

We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs…

In 1981, Lubiw proved that the fixed point free automorphism problem (FPFAut) is NP-complete: given a graph G, determine whether there exists an automorphism that maps no vertex of G to itself. We revisit this problem and prove that FPFAut…

This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…

Feature selection (FS) is a fundamental challenge in machine learning, particularly for high-dimensional tabular data, where interpretability and computational efficiency are critical. Existing FS methods often cannot automatically detect…

Full waveform inversion (FWI) is an iterative identification process that serves to minimize the misfit of model-based simulated and experimentally measured wave field data, with the goal of identifying a field of parameters for a given…