English
Related papers

Related papers: Desingularization Explains Order-Degree Curves for…

200 papers

We show that Ore operators can be desingularized by calculating a least common left multiple with a random operator of appropriate order. Our result generalizes a classical result about apparent singularities of linear differential…

Symbolic Computation · Computer Science 2014-08-26 Shaoshi Chen , Manuel Kauers , Michael F. Singer

Ore operators with polynomial coefficients form a common algebraic abstraction for representing D-finite functions. They form the Ore ring $K(x)[D_x]$, where $K$ is the constant field. Suppose $K$ is the quotient field of some principal…

Symbolic Computation · Computer Science 2017-10-23 Yi Zhang

It is known for linear operators with polynomial coefficients annihilating a given D-finite function that there is a trade-off between order and degree. Raising the order may give room for lowering the degree. The relationship between order…

Symbolic Computation · Computer Science 2022-05-13 Hui Huang , Manuel Kauers , Gargi Mukherjee

In this paper, we study the desingularization problem in the first $q$-Weyl algebra. We give an order bound for desingularized operators, and thus derive an algorithm for computing desingularized operators in the first $q$-Weyl algebra.…

Symbolic Computation · Computer Science 2018-03-12 Christoph Koutschan , Yi Zhang

It is well known that the composition of a D-finite function with an algebraic function is again D-finite. We give the first estimates for the orders and the degrees of annihilating operators for the compositions. We find that the analysis…

Symbolic Computation · Computer Science 2017-05-29 Manuel Kauers , Gleb Pogudin

Linear recurrence operators in characteristic $p$ are classified by their $p$-curvature. For a recurrence operator $L$, denote by $\chi(L)$ the characteristic polynomial of its $p$-curvature. We can obtain information about the…

Symbolic Computation · Computer Science 2022-02-21 Yi Zhou , Mark van Hoeij

It is well known that for a first order system of linear difference equations with rational function coefficients, a solution that is holomorphic in some left half plane can be analytically continued to a meromorphic solution in the whole…

Symbolic Computation · Computer Science 2018-02-06 Moulay A. Barkatou , Maximilian Jaroschek

The main results of our paper deal with the lifting problem for multilinear differential operators between complexes of horizontal de Rham forms on the infinite jet bundle. We answer the question when does an n-multilinear differential…

Differential Geometry · Mathematics 2007-05-23 Martin Markl , Steve Shnider

We present new examples of complexes of differential operators of order $k$ (any given positive integer) that satisfy div-curl and/or $L^1$-duality estimates.

Analysis of PDEs · Mathematics 2015-09-30 Loredana Lanzani , Andrew S. Raich

In [9], the celebrated K{\L}-inequality has been extended from definable functions $f:\mathbb{R}^{n}\rightarrow\mathbb{R} $ to definable multivalued maps $S:\mathbb{R}\rightrightarrows\mathbb{R}^{n}$, by establishing that the co-derivative…

Optimization and Control · Mathematics 2021-10-19 Aris Daniilidis , Sebastián Tapia-García

We give infinite triangularization and strict triangularization results for algebras of operators on infinite dimensional vector spaces. We introduce a class of algebras we call Ore-solvable algebras: these are similar to iterated Ore…

Rings and Algebras · Mathematics 2020-07-27 Miodrag Iovanov , Jeremy Edison , Alexander Sistko

An orientation $D$ of a graph $G=(V,E)$ is a digraph obtained from $G$ by replacing each edge by exactly one of the two possible arcs with the same end vertices. For each $v \in V(G)$, the indegree of $v$ in $D$, denoted by $d^-_D(v)$, is…

Computational Complexity · Computer Science 2020-12-01 Julio Araujo , Alexandre Cezar , Carlos V. G. C. Lima , Vinicius F. dos Santos , Ana Silva

This note is about promoting singularity subtraction as a helpful tool in the discretization of singular integral operators on curved surfaces. Singular and nearly singular kernels are expanded in series whose terms are integrated on…

Numerical Analysis · Mathematics 2013-01-31 Johan Helsing

A derived operation is a bilinear operation on a commutative associative algebra $A$ defined intrinsically out of its product and several derivations of the product. We show that operators of left (or right) multiplications of a derived…

Rings and Algebras · Mathematics 2025-11-25 Vladimir Dotsenko

Conventional ways to solve optimization problems on low-rank matrix sets which appear in great number of applications ignore its underlying structure of an algebraic variety and existence of singular points. This leads to appearance of…

Numerical Analysis · Mathematics 2017-10-04 Valentin Khrulkov , Ivan Oseledets

A graph is $d$-orientable if its edges can be oriented so that the maximum in-degree of the resulting digraph is at most $d$. $d$-orientability is a well-studied concept with close connections to fundamental graph-theoretic notions and…

Computational Complexity · Computer Science 2020-01-28 Tesshu Hanaka , Ioannis Katsikarelis , Michael Lampis , Yota Otachi , Florian Sikora

One of the general problems in algebraic geometry is to determine algorithmically whether or not a given geometric object, defined by explicit polynomial equations (e.g. a curve or a surface), satisfies a given property (e.g. has…

Algebraic Geometry · Mathematics 2013-08-20 A. Popolitov , Sh. Shakirov

We classify simple parametrisations of complex curve singularities. Simple means that all neighbouring singularities fall in finitely many equivalence classes. We take the neighbouring singularities to be the ones occurring in the versal…

Algebraic Geometry · Mathematics 2018-12-12 Jan Stevens

Let C be an irreducible smooth projective curve, of genus at least two, defined over an algebraically closed field of characteristic zero. For a fixed line bundle L on C, let M_C(r,L) be the coarse moduli space of semistable vector bundles…

Algebraic Geometry · Mathematics 2012-05-11 Indranil Biswas , Amit Hogadi , Yogish I. Holla

An oriented graph is a digraph that contains no 2-cycles, i.e., there is at most one arc between any two vertices. We show that every oriented graph $G$ of sufficiently large order $n$ with $\mathrm{deg}^+(x) +\mathrm{deg}^{-}(y)\geq…

Combinatorics · Mathematics 2025-07-08 Yulin Chang , Yangyang Cheng , Tianjiao Dai , Qiancheng Ouyang , Guanghui Wang
‹ Prev 1 2 3 10 Next ›