Related papers: A generalization of the Newton-Puiseux algorithm f…
An algorithm of the tensor renormalization group is proposed based on a randomized algorithm for singular value decomposition. Our algorithm is applicable to a broad range of two-dimensional classical models. In the case of a square…
An expansion of a density field or particle distribution in basis functions which solve the Poisson equation both provides an easily parallelized n-body force algorithm and simplifies perturbation theories. The expansion converges quickly…
The aim of this work is to reduce the complexity of the available algorithms for computing the generator sets of a semigroup ideal by using the Hermite normal form. In order to achieve it we introduce the concept of decomposable semigroup.…
In this paper we generalize the Deuring theorem on a reduction of elliptic curve with complex multiplication. More precisely, for an Abelian variety $A$, arising after reduction of an Abelian variety with complex multiplication by a CM…
Let $K$ be a local field of residue characteristic $p$. Let $C$ be a curve over $K$ whose minimal proper regular model has totally degenerate semi-stable reduction. Under certain hypotheses, we compute the prime-to-$p$ rational torsion…
Let $p\neq{2,3}$ be a prime number and let $\Gamma \subset \mathrm{SL}_{2}(\mathbb{Z})$ be a congruence subgroup with modular curve $X_{\Gamma}/K$ and Jacobian $J(X_{\Gamma})$. In this paper we give an explicit group-theoretic description…
Let $A$ be a $n$ by $n$ matrix. A skeleton decomposition is any factorization of the form $CUR$ where $C$ comprises columns of $A$, and $R$ comprises rows of $A$. In this paper, we consider uniformly sampling $\l\simeq k \log n$ rows and…
In this paper, an explanation of the Newton-Peiseux algorithm is given. This explanation is supplemented with well-worked and explained examples of how to use the algorithm to find fractional power series expansions for all branches of a…
The notion of a tamely ramified covering is canonical only for curves. Several notions of tameness for coverings of higher dimensional schemes have been used in the literature. We show that all these definitions are essentially equivalent.…
Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…
This paper introduces a novel general-purpose algorithm for Pauli decomposition that employs matrix slicing and addition rather than expensive matrix multiplication, significantly accelerating the decomposition of multi-qubit matrices. In a…
Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…
We produce an integral model for the modular curve $X(Np^m)$ over the ring of integers of a sufficiently ramified extension of $\mathbf{Z}_p$ whose special fiber is a {\em semistable curve} in the sense that its only singularities are…
The paper is an introduction to the use of the classical Newton-Puiseux procedure, oriented to an algorithmic description of it. This procedure enables to get polynomial approximations for parameterizations of branches of an algebraic plane…
Skeletonization extracts thin representations from images that compactly encode their geometry and topology. These representations have become an important topological prior for preserving connectivity in curvilinear structures, aiding…
One of the major successes in computational biology has been the unification, using the graphical model formalism, of a multitude of algorithms for annotating and comparing biological sequences. Graphical models that have been applied…
A p-divisible group over a complete local domain determines a Galois representation on the Tate module of its generic fibre. We determine the image of this representation for the universal deformation in mixed characteristic of a…
We show that the non-Archimedean skeleton of the $d$-th symmetric power of a smooth projective algebraic curve $X$ is naturally isomorphic to the $d$-th symmetric power of the tropical curve that arises as the non-Archimedean skeleton of…
Quantum computers are believed to have the ability to process huge data sizes which can be seen in machine learning applications. In these applications, the data in general is classical. Therefore, to process them on a quantum computer,…
In this paper we prove an explicit formula which compares the dimensions of the spaces of vanishing cycles in a Galois cover of degree p between formal germ of curves over a complete discrete valuation ring of inequal characteristics (0,p).…