Related papers: A generalization of the Newton-Puiseux algorithm f…
Let $(R,\mathfrak{m}, k)$ be a strictly local normal $k$-domain of positive characteristic and $P$ be a prime divisor on $X=\text{Spec } R$. We study the Galois category of finite covers over $X$ that are at worst tamely ramified over $P$…
We consider the extension of the method of Gauss-Newton from complex floating-point arithmetic to the field of truncated power series with complex floating-point coefficients. With linearization we formulate a linear system where the…
This is a survey paper on applications of mathematics of semirings to numerical analysis and computing. Concepts of universal algorithm and generic program are discussed. Relations between these concepts and mathematics of semirings are…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
In the context of state-space models, skeleton-based smoothing algorithms rely on a backward sampling step which by default has a $\mathcal O(N^2)$ complexity (where $N$ is the number of particles). Existing improvements in the literature…
A particle-in-cell algorithm is derived with a canonical Poisson structure in the formalism of finite element exterior calculus. The resulting method belongs to the class of gauge-compatible splitting algorithms, which exactly preserve…
Recent results in the theory and application of Newton-Puiseux expansions, i.e. fractional power series solutions of equations, suggest further developments within a more abstract algebraic-geometric framework, involving in particular the…
In this paper we prove a relative version of the classical Mumford-Newstead theorem for a family of smooth curves degenerating to a reducible curve with a simple node. We also prove a Torelli-type theorem by showing that certain moduli…
We give an intrinsic parametrisation of the set of tamely ramified extensions of a local field with finite residue field and bring to the fore the role played by group cohomology. We show that two natural definitions of the cohomology class…
In this paper we study the semi-stable reduction of $p$ and $p^2$-cyclic covers of curves in equal characteristic $p>0$. The main tool we use is the classical Artin-Schreier-Witt theory for $p^n$-cyclic covers in characteristic $p$.…
Continuing the analysis in a unified scheme for treating generalized superselection sectors based upon the notion of selection criteria for states of relevance in quantum physics, we extend the Doplicher-Roberts superselection theory for…
This paper is concerned with rational curves on real classical groups. Our contributions are three-fold: (i) We determine the structure of quadratic rational curves on real classical groups. As a consequence, we completely classify…
We generalize the Moishezon Teicher algorithm that was suggested for the computation of the braid monodromy of an almost real curve. The new algorithm suits a larger family of curves, and enables the computation of braid monodromy not only…
Tensor networks are the main building blocks in a wide variety of computational sciences, ranging from many-body theory and quantum computing to probability and machine learning. Here we propose a parallel algorithm for the contraction of…
In the context of complex algebraic varieties, the decomposition theorem for semi-small maps provides a decomposition of the direct image of the constant sheaf. In this work, we develop a decomposition theorem for branched coverings of…
Finding dense components in graphs is of great importance in analyzing the structure of networks. Popular and computationally feasible frameworks for discovering dense subgraphs are core and truss decompositions. Recently, Sariyuce et al.…
We define the notion of inseparable coverings of schemes and we propose a ramification formalism for them, along the lines of the classical one. Using this formalism we prove a formula analogous to the classical Riemann-Hurwitz formula for…
Many of the algorithms used to solve minimization problems with sparsity-inducing regularizers are generic in the sense that they do not take into account the sparsity of the solution in any particular way. However, algorithms known as…
This paper describes the adaptation of a well-scaling parallel algorithm for computing Morse-Smale segmentations based on path compression to a distributed computational setting. Additionally, we extend the algorithm to efficiently compute…
Solving the exact renormalisation group equation a la Wilson-Polchinski perturbatively, we derive a power-counting theorem for general matrix models with arbitrarily non-local propagators. The power-counting degree is determined by two…