Related papers: A One-Way Function Based On The Extended Euclidean…
We devise an algorithm that approximately computes the number of paths of length $k$ in a given directed graph with $n$ vertices up to a multiplicative error of $1 \pm \varepsilon$. Our algorithm runs in time $\varepsilon^{-2} 4^k(n+m)…
A possible method to solve the sign problem is developed by modifying the original theory. Considering several modifications of the partition function, the observable in the original theory is reconstructed from the identity connecting the…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…
The factorization technique for superintegrable Hamiltonian systems is revisited and applied in order to obtain additional (higher-order) constants of the motion. In particular, the factorization approach to the classical anisotropic…
From the integration of non-symmetrical hyperboles, a one-parameter generalization of the logarithmic function is obtained. Inverting this function, one obtains the generalized exponential function. We show that functions characterizing…
The theory of Chebyshev approximation has been extensively studied. In most cases, the optimality conditions are based on the notion of alternance or alternating sequence (that is, maximal deviation points with alternating deviation signs).…
We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…
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…
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…
The main purpose of this paper is to introduce and investigate a class of generalized Bernoulli polynomials and Euler polynomials based on the generating function. we unify all forms of q-exponential functions by one more parameter. we…
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
The first aim of this paper is to construct new generating functions for the generalized {\lambda}-Stirling type numbers of the second kind, generalized array type polynomials and generalized Eulerian type polynomials and numbers, attached…
We review and extend a technique for recovering a smooth function from its averages over a wide class of curves in a general region of Euclidean space. The method is based on complexification of the underlying vector fields defining the…
In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…
Many interesting families of polynomials are indexed by permutations or related objects, and are defined by applying divided difference operators, modified by polynomials, on some initial base case. The fact that these constructions produce…
For a general one-sided nonautonomous dynamics defined by a sequence of linear operators, we consider the notion of a polynomial dichotomy with respect to a sequence of norms and we characterize it completely in terms of the admissibility…
We develop several notions of multiplicity for linear factors of multivariable polynomials over different arithmetics (hyperfields). The key example is multiplicities over the hyperfield of signs, which encapsulates the arithmetic of…
Almost all problems in applied mathematics, including the analysis of dynamical systems, deal with spaces of real-valued functions on Euclidean domains in their formulation and solution. In this paper, we describe the the tool Ariadne,…
We lift to the multivariate Eulerian polynomials the identity implying that univariate Eulerian polynomials are palindromic. As a consequence of this generalization, we obtain nice combinatorial identities that can be directly extracted…
In the present paper we derive complicated families of orthogonal polynomials in one variable from scratch using the known ones as building blocks. We recall the basics of operational formalism and introduce the notations we use throughout…