Related papers: A heuristic algorithm for computing the Poincar\'e…
We define a new equivariant (with respect to a finite group $G$ action) version of the Poincar\'e series of a multi-index filtration as an element of the power series ring ${\widetilde{A}}(G)[[t_1, \ldots, t_r]]$ for a certain modification…
We discuss quantum algorithms that calculate numerical integrals and descriptive statistics of stochastic processes. With either of two distinct approaches, one obtains an exponential speed increase in comparison to the fastest known…
In recent years, differential equations have become the method of choice to compute multi-loop Feynman integrals. Whenever they can be cast into canonical form, their solution in terms of special functions is straightforward. Recently,…
This paper deals with fundamental properties of Poincar\'e half-maps defined on a straight line for planar linear systems. Concretely, we focus on the analyticity of the Poincar\'e half-maps, their series expansions (Taylor and…
The inversion problem for rational B\'ezier curves is addressed by using resultant matrices for polynomials expressed in the Bernstein basis. The aim of the work is not to construct an inversion formula but finding the corresponding value…
We compute the quotient of the self-duality equation for conformal metrics by the action of the diffeomorphism group. We also determine Hilbert polynomial, counting the number of independent scalar differential invariants depending on the…
The Ehrhart polynomial and Ehrhart series count lattice points in integer dilations of a lattice polytope. We introduce and study a $q$-deformation of the Ehrhart series, based on the notions of harmonic spaces and Macaulay's inverse…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
We resolve a problem of finding the Poincare symmetries from hamiltonian gauge symmetries constructed through a canonical procedure of handling constrained systems. Through the use of Noether identities corresponding to the symmetries, we…
Poincare polinomials of hyperbolic Lie algebras, which are given by $HA_2$ and $HA_3$ in the Kac's notation, are calculated explicitly. The results show that there is a significant form for hyperbolic Poincare polinomials. Their explicit…
We study Poincar\'e Duality in the context of abstract 6-functor formalisms. In particular, we give a small and simple list of assumptions that implies Poincar\'e Duality. As an application, we give new uniform (and essentially formal)…
Poincar\'e and Eisenstein series are building blocks for every type of modular forms. We define Poincar\'e series for Jacobi forms of lattice index and state some of their basic properties. We compute the Fourier expansions of Poincar\'e…
In this paper we show some explicit results regarding non-linear diffusive equations on Poincar\'e half plane. We obtain exact solutions by using the generalized separation of variables and we also show the meaning of these results in the…
We have recently show that Poincare series of Hyperbolic Lie algebras have the form of a ratio between Poincare series of a chosen finite Lie algebra and a polynomial of finite degree. By the aid of some properly chosen examples, we now…
Let $V$ be a finite dimensional representations of the group $\operatorname{SL}_2$ of $2\times 2$ matrices with complex coefficients and determinant one. Let $R=\mathbb{C}[V]^{\operatorname{SL}_2}$ be the algebra of…
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…
One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…
This paper presents a Hoare-like veri cation framework for discrete probabilistic programs that we apply to two non-trivial sampling algorithms: Lumbroso's Fast Dice Roller and Saad et al.'s Fast Loaded Dice Roller. These algorithms have…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
New geometric methods for fast evaluation of derivatives of polynomial and rational B\'{e}zier curves are proposed. They apply an algorithm for evaluating polynomial or rational B\'{e}zier curves, which was recently given by the authors.…