Related papers: A generalization of the Newton-Puiseux algorithm f…

We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…

Let $X$ be a smooth geometrically connected projective curve over the field of fractions of a discrete valuation ring $R$, and $\mathfrak{m}$ a modulus on $X$, given by a closed subscheme of $X$ which is geometrically reduced. The…

A new generalized cyclic symmetric structure in the factor matrices of polyadic decompositions of matrix multiplication tensors for non-square matrix multiplication is proposed to reduce the number of variables in the optimization problem…

The well-known Newton-Puiseux Theorem states that each real branch of a planar real analytic curve admits a Puiseux expansion. We generalize this result to characteristic orbit of an isolated singularity of a planar real analytic vector…

We propose a novel generalisation to the Student-t Probabilistic Principal Component methodology which: (1) accounts for an asymmetric distribution of the observation data; (2) is a framework for grouped and generalised…

We introduce a method to enforce some symmetries starting from a trial wave-function prepared on quantum computers that might not respect these symmetries. The technique eliminates the necessity for performing the projection on the quantum…

A thorough account is given of the derivation of uniform semiclassical approximations to the particle and kinetic energy densities of N noninteracting bounded fermions in one dimension. The employed methodology allows the inclusion of…

Deep neural networks exploiting millions of parameters are nowadays the norm in deep learning applications. This is a potential issue because of the great amount of computational resources needed for training, and of the possible loss of…

We give an exact algorithm to calculate (under some GKM-restriction) the matrix describing the embedding $\B(\s)_x\subset\B(\s)^x$, where the first module is the costalk and the second one is the stalk at $x$ of a Bott-Samelson module…

We generalize the notion of quasielliptic curves, which have infinitesimal symmetries and exist only in characteristic two and three, to a remarkable hierarchy of regular curves having infinitesimal symmetries, defined in all…

Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…

Achieving the goals in the title (and others) relies on a cardinality-wise scanning of the ideals of the poset. Specifically, the relevant numbers attached to the k+1 element ideals are inferred from the corresponding numbers of the…

In this paper, we propose a general algorithmic framework to solve a class of optimization problems on the product of complex Stiefel manifolds based on the matrix polar decomposition. We establish the weak convergence, global convergence…

We consider cyclic unramified coverings of degree d of irreducible complex smooth genus 2 curves and their corresponding Prym varieties. They provide natural examples of polarized abelian varieties with automorphisms of order d. The rich…

In this paper we outline an algorithmic approach to compute Puiseux series expansions for algebraic surfaces. The series expansions originate at the intersection of the surface with as many coordinate planes as the dimension of the surface.…

We present an algorithm which, given a connected smooth projective curve $X$ over an algebraically closed field of characteristic $p>0$ and its Hasse--Witt matrix, as well as a positive integer $n$, computes all \'etale Galois covers of $X$…

Most machine learning models for structured data encode the structural knowledge of a node by leveraging simple aggregation functions (in neural models, typically a weighted sum) of the information in the node's neighbourhood. Nevertheless,…

We consider local-global principles for torsors under linear algebraic groups, over function fields of curves over complete discretely valued fields. The obstruction to such a principle is a version of the Tate-Shafarevich group; and for…

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017)]. By encoding the truth table of each vertex…