Related papers: Desingularization Explains Order-Degree Curves for…
The linear ordering problem (LOP), which consists in ordering M objects from their pairwise comparisons, is commonly applied in many areas of research. While efforts have been made to devise efficient LOP algorithms, verification of whether…
\noindent In \cite{Casas} Casas-Alvero found decompositions of higher order polars of an irreducible plane curve generalizing the results of Merle. We improve his result giving a finer decomposition where we determine the topological type…
The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed on the devices. Using deep results from discrepancy theory, we improve previous…
We provide bounds on the size of operators obtained by algorithms for executing D-finite closure properties. For operators of small order, we give bounds on the degree and on the height (bit-size). For higher order operators, we give degree…
An ordered labeled tree is a tree in which the nodes are labeled and the left-to-right order among siblings is relevant. The edit distance between two ordered labeled trees is the minimum cost of changing one tree into the other through a…
Recent advances in operator learning theory have improved our knowledge about learning maps between infinite dimensional spaces. However, for large-scale engineering problems such as concurrent multiscale simulation for mechanical…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
Our main result is that the Steiner Point Removal (SPR) problem can always be solved with polylogarithmic distortion, which answers in the affirmative a question posed by Chan, Xia, Konjevod, and Richa (2006). Specifically, we prove that…
This paper is devoted to understanding curves $X$ over a number field $k$ that possess infinitely many solutions in extensions of $k$ of degree at most $d$; such solutions are the titular low degree points. For $d=2,3$ it is known (by the…
The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every edge is realized as a y-monotone curve. In the variant…
A simplicial set is said to be non-singular if the representing map of each non-degenerate simplex is degreewise injective. The inclusion into the category of simplicial sets, of the full subcategory whose objects are the non-singular…
We prove a desingularization theorem for the quasi-smooth derived scheme, in the sense of Hekking. We also propose the conjecture that the K-theoretic integration of the virtual fundamental class of a quasi-smooth derived scheme could be…
This work is a continuation of [13]. We study the linear disjointness between higher-order oscillating sequences and nonlinear dynamical systems. Specifically, we prove that any oscillating sequence of order $m=d+k-1$ and any simple…
Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…
Normal multi-scale transform [4] is a nonlinear multi-scale transform for representing geometric objects that has been recently investigated [1, 7, 10]. The restrictive role of the exact order of polynomial reproduction $P_e$ of the…
The aim of the papers is to describe the left regular left quotient ring ${}'Q(R)$ and the right regular right quotient ring $Q'(R)$ for the following algebras $R$: $\mS_n=\mS_1^{\t n}$ is the algebra of one-sided inverses, where…
The notions of equivalence and strict equivalence for order one differential equations are introduced. The more explicit notion of strict equivalence is applied to examples and questions concerning autonomous equations and equations having…
Let $D=(V,A)$ be an acyclic digraph. For $x\in V$ define $e_{_{D}}(x)$ to be the difference of the indegree and the outdegree of $x$. An acyclic ordering of the vertices of $D$ is a one-to-one map $g: V \rightarrow [1,|V|] $ that has the…
In this note we determine, for an arbitrary but a fixed degree $d$, an algorithm to list the possible values $m$ for which $M_g^{Pl}(\mathbb{Z}/m)$ is non-empty where $\mathbb{Z}/m$ denotes the cyclic group of order $m$. In particular, we…
This note is devoted, after the result of Harui, arXiv:1306.5842, to solve some natural questions for non-singular plane curves of degree $d$ over an algebraically closed field $K$ of zero characteristic.