Related papers: Algebraic Diagonals and Walks

Here, in a series of articles, we show methods for calculating propositional statements using algebraic polynomials as symbols for the connectives, which are named operators. These polynomials originate from the transformation between the…

We consider the distribution of the binomial probability mass function (pmf) among arithmetic progressions and obtain an average-type theorem. As applications, we consider the possible visits to a kind of sieved sets of integers or lattice…

In this paper, we generalize the notion of functional graph. Specifically, given an equation $E(X,Y) = 0$ with variables $X$ and $Y$ over a finite field $\mathbb{F}_q$ of odd characteristic, we define a digraph by choosing the elements in…

The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…

Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…

We study the enumeration of closed walks of given length and algebraic area on the honeycomb lattice. Using an irreducible operator realization of honeycomb lattice moves, we map the problem to a Hofstadter-like Hamiltonian and show that…

It is well-known that the length generating function E(t) of Dyck paths (excursions with steps +1 and -1) satisfies 1-E+t^2E^2=0. The generating function E^(k)(t) of Dyck paths of height at most k is E^(k)=F_k/F_{k+1}, where the F_k are…

This is the first of series of talks presented at a permanent Rutgers workshop on noncommutative algebra and geometry. We study here quadratic and quadratic-linear algebras defined by factorizations of noncommutative polynomials and…

Let X be an affine real algebraic set . We investigate on the theory of algebraically constructible functions on X and the description of the semi-algebraic subsets of X when we replace the polynomial functions on X by some rational…

This paper is devoted to the factorization of multivariate polynomials into products of linear forms, a problem which has applications to differential algebra, to the resolution of systems of polynomial equations and to Waring decomposition…

We consider a generalization of polynomial programs: algebraic programs, which are optimization or feasibility problems with algebraic objectives or constraints. Algebraic functions are defined as zeros of multivariate polynomials. They are…

In this paper we present an algorithmic procedure that transforms, if possible, a given system of ordinary or partial differential equations with radical dependencies in the unknown function and its derivatives into a system with polynomial…

In this paper we obtain some properties of orthogonal polynomials given by a weight function which is a limit density of a rescaled discrete-time quantum walk on the line.

The class of functions from the integers to the integers computable in polynomial time has been characterized recently using discrete ordinary differential equations (ODE), also known as finite differences. In the framework of ordinary…

We study Loewner chains in $\mathcal{H}_0(\mathbb{D})$ without assuming univalence of each element. We prove a decomposition: every chain admits a factorization $f_t=F\circ g_t$, where $F$ is analytic on $\mathbb{D}(0,r)$ with $r=\lim_{t…

Partially commutative monoids provide a powerful tool to study graphs, viewingwalks as words whose letters, the edges of the graph, obey a specific commutation rule. A particularclass of traces emerges from this framework, the hikes, whose…

We introduce G{\aa}rding polynomials, a class of real multivariate polynomials characterized by positivity regions that are invariant under translation by positive vectors and closed under strictly positive affine transformations. We prove…

A classical problem in Distance Geometry, with multiple practical applications (in molecular structure determination, sensor network localization etc.) is to find the possible placements of the vertices of a graph with given edge lengths.…

An important invariant of a polynomial $f$ is its Jacobian algebra defined by its partial derivatives. Let $f$ be invariant with respect to the action of a finite group of diagonal symmetries $G$. We axiomatically define an orbifold…

We generalize the Umbral Calculus of G-C. Rota by studying not only sequences of polynomials and inverse power series, or even the logarithms studied in, but instead we study sequences of formal expressions involving the iterated logarithms…