Related papers: Detecting fully irreducible automorphisms: a polyn…
We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…
We investigate the problem of fitting piecewise affine functions (PWA) to data. Our algorithm divides the input domain into finitely many polyhedral regions whose shapes are specified using a user-defined template such that the data points…
We give an algorithm for finding the index of a positive outer automorphism of the free group, and prove the algorithm exits in a finite time.
This is the fourth and last in a series of four papers (with research announcement posted on this arXiv) that develop a decomposition theory for subgroups of $\text{Out}(F_n)$. In this paper we develop general ping-pong techniques for the…
Inferring probabilistic networks from data is a notoriously difficult task. Under various goodness-of-fit measures, finding an optimal network is NP-hard, even if restricted to polytrees of bounded in-degree. Polynomial-time algorithms are…
The individualization-refinement paradigm provides a strong toolbox for testing isomorphism of two graphs and indeed, the currently fastest implementations of isomorphism solvers all follow this approach. While these solvers are fast in…
Full-Waveform Inversion (FWI) has now become a widely accepted tool to obtain high-resolution velocity models from seismic data. Typically, the velocity model in its discrete form is represented on a rectangular grid, and we solve for the…
The ARRIVAL problem is to decide the fate of a train moving along the edges of a directed graph, according to a simple (deterministic) pseudorandom walk. The problem is in $NP \cap coNP$ but not known to be in $P$. The currently best…
We consider a general class of Fourier coefficients for an automorphic form on a finite cover of a reductive adelic group ${\bf G}(\mathbb{A}_{\mathbb{K}})$, associated to the data of a `Whittaker pair'. We describe a quasi-order on Fourier…
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 propose a novel exact algorithm for the transportation problem, one of the paradigmatic network optimization problems. The algorithm, denoted Iterated Inside Out, requires in input a basic feasible solution and is composed by two main…
Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization,…
This is the first of two papers in which we investigate the properties of the displacement functions of automorphisms of free groups (more generally, free products) on Culler-Vogtmann Outer space and its simplicial bordification - the free…
The training algorithms for AI systems all introduce far-from-equilibrium dynamical processes, and understanding the irreversibility of these algorithms is a fundamental step towards understanding the learning dynamics of modern AI systems.…
We present an algorithm that takes as input a graph $G$ with weights on the vertices, and computes a maximum weight independent set $S$ of $G$. If the input graph $G$ excludes a path $P_k$ on $k$ vertices as an induced subgraph, the…
How does the arrow of time (dissipative, irreversible behavior) emerge from time-reversible Hamiltonian mechanics? Two ingredients are needed: the underlying system must be ergodic or phase-mixing, and our knowledge of the system must be…
A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…
In this paper, we demonstrate that considering experiments in a graph-theoretic manner allows us to exploit automorphisms of the graph to reduce the number of evaluations of candidate designs for those experiments, and thus find optimal…
We present a novel approach to optimizing the reduction of Feynman integrals using integration-by-parts identities. By developing a priority function through the FunSearch algorithm, which combines large language models and genetic…
We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…