Related papers: Computing with D-Algebraic Sequences
Let $A$ and $B$ be finite-dimensional simple algebras with arbitrary signature over an algebraically closed field. Suppose $A$ and $B$ are graded by a semigroup $S$ so that the graded identitical relations of $A$ are the same as those of…
Abstract differential-algebraic equations (ADAEs) of a semilinear type are studied. Theorems on the existence and uniqueness of solutions and the maximal interval of existence, on the global solvability of the ADAEs, the boundedness of…
We propose a differential analog of the notion of integral closure of algebraic function fields. We present an algorithm for computing the integral closure of the algebra defined by a linear differential operator. Our algorithm is a direct…
With distributed computing and mobile applications, synchronizing diverging replicas of data structures is a more and more common problem. We use algebraic methods to reason about filesystem operations, and introduce a simplified definition…
We present a graph-theoretical approach that can detect which equations of a delay differential-algebraic equation (DDAE) need to be differentiated or shifted to construct a solution of the DDAE. Our approach exploits the observation that…
Let $X$ be a complex analytic manifold, $D\subset X$ a locally quasi-homogeneous free divisor, $E$ an integrable logarithmic connection with respect to $D$ and $L$ the local system of the horizontal sections of $E$ on $X-D$. In this paper…
In this paper, we introduce and study differential graded (DG for short) polynomial algebras. In brief, a DG polynomial algebra $\mathcal{A}$ is a connected cochain DG algebra such that its underlying graded algebra $\mathcal{A}^{\#}$ is a…
A variety is a category of ordered (finitary) algebras presented by inequations between terms. We characterize categories enriched over the category of posets which are equivalent to a variety. This is quite analogous to Lawvere's classical…
We describe differential invariants of infinite-dimensional algebras being equivalence algebras of some classes of PDE and study structure of these algebras.
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
The algebraic geometry of a universal algebra $\mathbf{A}$ is defined as the collection of solution sets of term equations. Two algebras $\mathbf{A}_1$ and $\mathbf{A}_2$ are called algebraically equivalent if they have the same algebraic…
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
It was recently conjectured that every component of a discrete-time rational dynamical system is a solution to an algebraic difference equation that is linear in its highest-shift term (a quasi-linear equation). We prove that the conjecture…
A semi-algebraic set is a subset of $\mathbb{R}^n$ defined by a finite collection of polynomial equations and inequalities. In this paper, we investigate the problem of determining whether two points in such a set belong to the same…
We call a log variety (X, D) algebraically hyperbolic if there exists a positive number e such that 2g(C) - 2 + i(C, D) >= e deg(C) for all curves C on X, where i(C, D) is the number of the intersections between D and the normalization of…
Given a graded ring $A$ and a homogeneous ideal $I$, the ideal is said to be of linear type if the Rees algebra of $I$ is isomorphic to the symmetric algebra of $I$. In general, $y$-regularity of Rees algebra of $I$ is $0 \Rightarrow$ $I$…
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…
The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…
A delayed term in a differential equation reflects the fact that information takes significant time to travel from one place to another within a process being studied. Despite de apparent similarity with ordinary differential equations,…