Related papers: A generalization of the Newton-Puiseux algorithm f…
In this paper, we study tame Galois coverings of semistable models that arise from torsion points on elliptic curves. These coverings induce Galois morphisms of intersection graphs and we express the decomposition groups of the edges in…
Daily internet communication relies heavily on tree-structured graphs, embodied by popular data formats such as XML and JSON. However, many recent generative (probabilistic) models utilize neural networks to learn a probability distribution…
We analyze the problem of global reconstruction of functions as accurately as possible, based on partial information in the form of a truncated power series at some point, and additional analyticity properties. This situation occurs…
Let $K$ be a local field of residue characteristic $p>0$. We explain how to compute the semistable reduction of $K$-curves $Y$ equipped with a degree-$p$ morphism from $Y$ to the projective line. This includes the reduction at $p$ of…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
We introduce a notion of tame ramification for general finite covers. When specialized to the separable case, it extends to higher dimensions the classical notion of tame ramification for Dedekind domains and curves and sits nicely in…
Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years the replica-symmetry-breaking mean field theory of spin glasses and the…
We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets of node and edge types subject to edge length and…
In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…
We study stable reduction of curves in the case where a tamely ramified base extension is sufficient. If X is a smooth curve defined over the fraction field of a strictly henselian discrete valuation ring, there is a criterion, due to T.…
We discuss the successes and limitations of statistical sampling for a sequence of models studied in the context of lattice QCD and emphasize the need for new methods to deal with finite-density and real-time evolution. We show that these…
One of the most promising applications of near-term quantum computing is the simulation of quantum systems, a classically intractable task. Quantum simulation requires computationally expensive matrix exponentiation; Trotter-Suzuki…
In the paper, a Newton-type method for the solution of generalized equations (GEs) is derived, where the linearization concerns both the single-valued and the multi-valued part of the considered GE. The method is based on the new notion of…
A numerical algorithm to decompose an exact low-rank skew-symmetric tensor into a sum of elementary (rank-$1$) skew-symmetric tensors is introduced. The algorithm uncovers this Grassmann decomposition based on linear relations that are…
Let $R$ be a discrete valuation ring of field of fractions $K$ and of residue field $k$ of characteristic $p > 0$. In an earlier work, we studied the question of extending torsors on $K$-curves into torsors over $R$-regular models of the…
The skeleton is an essential shape characteristic providing a compact representation of the studied shape. Its computation on the image grid raises many issues. Due to the effects of discretization, the required properties of the skeleton -…
We present a polyhedral algorithm to manipulate positive dimensional solution sets. Using facet normals to Newton polytopes as pretropisms, we focus on the first two terms of a Puiseux series expansion. The leading powers of the series are…
In this article, we introduce the idempotentization process, which bears some philosophical and mathematical similarities with modern analytification and tropicalization. Idempotentization associates to any affine scheme an idempotent…
A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…
We consider parahoric Bruhat-Tits group schemes over a smooth projective curve and torsors under them. If the characteristic of the ground field is either zero or positive but not too small and the generic fiber is absolutely simple and…