Related papers: Computing with D-Algebraic Sequences
An algebraizable singularity is a germ of a singular holomorphic foliation which can be defined in some appropriate local chart by a differential equation with algebraic coefficients. We show that there exists at least countably many…
Differential forms is a highly geometric formalism for physics used from field theories to General Relativity (GR) which has been a great upgrade over vector calculus with the advantages of being coordinate-free and carrying a high degree…
An equilevel algebra is a subalgebra of the space of smooth functions $f: M \to {\mathbb R}$ distinguished in this space by finitely many linear conditions of the type $f(x_i) = f(\tilde x_i)$, $x_i \neq \tilde x_i \in M$, or approximated…
Let K be a subfield of the complex numbers, and let D be the Weyl algebra of K-linear differential operators on K[x_1,...,x_n]. If M and N are holonomic left D-modules we present an algorithm that computes explicit generators for the finite…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…
A sequence $D=(d_1,d_2,\ldots,d_n)$ of non-negative integers is called a graphic sequence if there is a simple graph with vertices $v_1,v_2,\ldots,v_n$ such that the degree of $v_i$ is $d_i$ for $1\leq i\leq n$. Given a graph theoretical…
Monographs are graph-like structures with directed edges of unlimited length that are freely adjacent to each other. The standard nodes are represented as edges of length zero. They can be drawn in a way consistent with standard graphs and…
Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…
Two algebroid branches are said to be equivalent if they have the same multiplicity sequence. It is known that two algebroid branches $R$ and $T$ are equivalent if and only if their Arf closures, $R'$ and $T'$ have the same value semigroup,…
With distributed computing and mobile applications becoming ever more prevalent, synchronizing diverging replicas of the same data is a common problem. Reconciliation -- bringing two replicas of the same data structure as close as possible…
Let $G$ be a group and $G_0 \subseteq G$ be a subset. A sequence over $G_0$ means a finite sequence of terms from $G_0$, where the order of elements is disregarded and the repetition of elements is allowed. A product-one sequence is a…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
We explore the notion of degree of asymmetry for integer sequences and related combinatorial objects. The degree of asymmetry is a new combinatorial statistic that measures how far an object is from being symmetric. We define this notion…
Novel dynamic programming algorithms to count the set $D(n)$ of zero-free degree sequences of length $n$, the set $D_c(n)$ of degree sequences of connected graphs on $n$ vertices and the set $D_b(n)$ of degree sequences of biconnected…
In this survey article we discuss the question: to what extent is an algebraic variety determined by its ring of differential operators? In the case of affine curves, this question leads to a variety of mathematical notions such as the Weyl…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…
Differential equations where the graph of some derivative of a function is composed of a finite number of similarity transformations of the graph of the function itself are defined. We call these self-similar differential equations (SSDEs)…
Let A and B be finite dimensional simple real algebras with division gradings by an abelian group G. In this paper we give necessary and sufficient conditions for the coincidence of the graded identities of A and B. We also prove that every…
This paper gives a key definition, for a new approach to dessins and algebraic numbers. The distant goal is to construct from each dessin $D$ an algebraic number $\eta_D$, in a systematic and useful way. The algebra of balanced dessins is…