English
Related papers

Related papers: Computing with D-Algebraic Sequences

200 papers

Discrete Differential Equations (DDEs) are functional equations that relate polynomially a power series $F(t,u)$ in $t$ with polynomial coefficients in a "catalytic" variable $u$ and the specializations, say at $u=1$, of $F(t,u)$ and of…

Symbolic Computation · Computer Science 2023-05-01 Alin Bostan , Hadrien Notarantonio , Mohab Safey El Din

We study the question of whether a sequence d = (d_1,d_2, \ldots, d_n) of positive integers is the degree sequence of some outerplanar (a.k.a. 1-page book embeddable) graph G. If so, G is an outerplanar realization of d and d is an…

Data Structures and Algorithms · Computer Science 2024-05-07 Amotz Bar-Noy , Toni Bohnlein , David Peleg , Yingli Ran , Dror Rawitz

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

Symbolic Computation · Computer Science 2026-01-14 Louis Gaillard

We give the definition of a dg-division algebra, that is a concept of a differential graded algebra which may serve as an analogue of a division algebra. We classify them completely, and show that they are either acyclic or have…

Rings and Algebras · Mathematics 2024-10-16 Alexander Zimmermann

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

Rings and Algebras · Mathematics 2011-12-22 Gábor Ivanyos , Lajos Rónyai , Josef Schicho

Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…

Differential Geometry · Mathematics 2026-05-19 Boris Kruglikov , Eivind Schneider

In this work, we define new sequence spaces by combining generalized weighted mean and difference operator. Afterward, we investigate topological structure which are completeness, AK-property, AD-property. Also, we compute the alpha, beta…

Functional Analysis · Mathematics 2010-07-27 Harun Polat , Vatan Karakaya , Necip Simsek

We introduce hypergeometric-type sequences. They are linear combinations of interlaced hypergeometric sequences (of arbitrary interlacements). We prove that they form a subring of the ring of holonomic sequences. An interesting family of…

Symbolic Computation · Computer Science 2024-04-22 Bertrand Teguia Tabuguia

Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…

Functional Analysis · Mathematics 2007-05-23 Antoine Delcroix , Maximilian F. Hasler , Stevan Pilipović , Vincent Valmorin

We study the boundedness of families of algebraic flat connections with bounded irregularity. As an application, we study the boundedness of families of holonomic $D$-modules with dominated characteristic cycles.

Algebraic Geometry · Mathematics 2026-03-04 Takuro Mochizuki

There exists a particular subset of algebraic power series over a finite field which, for different reasons, can be compared to the subset of quadratic real numbers. The continued fraction expansion for these elements, called…

Number Theory · Mathematics 2015-05-13 Alain Lasjaunias

In hypergraph theory, determining a characterization of the degree sequence $d=(d_1,d_2,\ldots,d_n)$ where $d_1\ge d_2\ge\ldots,d_n$ are positive integers, of an $h$-uniform simple hypergraph $\cal H$, and deciding the complexity status of…

Combinatorics · Mathematics 2013-10-01 A. Frosini , C. Picouleau , S. Rinaldi

A k-digraph is an orientation of a multi-graph that is without loops and contains at most k edges between any pair of distinct vertices. We obtain necessary and sufficient conditions for a sequence of non-negative integers in non-decreasing…

Combinatorics · Mathematics 2007-05-23 S. Pirzada , U. Samee

Semialgebraic splines are functions that are piecewise polynomial with respect to a cell decomposition into sets defined by polynomial inequalities. We study bivariate semialgebraic splines, formulating spaces of semialgebraic splines in…

Commutative Algebra · Mathematics 2016-04-21 Michael DiPasquale , Frank Sottile , Lanyin Sun

Given the degree sequence $d$ of a graph, the realization graph of $d$ is the graph having as its vertices the labeled realizations of $d$, with two vertices adjacent if one realization may be obtained from the other via an edge-switching…

Combinatorics · Mathematics 2019-09-17 Michael D. Barrus

We introduce an algebraicity criteria. It has the following form: under certain conditions, an analytic subvariety of some algebriac variety over a global field $K$, if it contains many $K$-points, then it is algebraic over $K.$ This gives…

Number Theory · Mathematics 2022-02-21 Junyi Xie

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

Number Theory · Mathematics 2022-06-22 Sergiy Koshkin

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

Rings and Algebras · Mathematics 2023-07-14 Libor Barto , Antoine Mottet

Semi-regular sequences over $\mathbb{F}_2$ are sequences of homogeneous elements of the algebra $ B^{(n)}=\mathbb{F}_2[X_1,...,X_n]/(X_1^2,...,X_n^2) $, which have as few relations between them as possible. They were introduced in order to…

Commutative Algebra · Mathematics 2014-12-30 T. J. Hodges , S. D. Molina , J. Schlather

This paper studies the expressive and computational power of discrete Ordinary Differential Equations (ODEs), a.k.a. (Ordinary) Difference Equations. It presents a new framework using these equations as a central tool for computation and…

Logic in Computer Science · Computer Science 2022-09-27 Olivier Bournez , Arnaud Durand