Related papers: Geometry of multidimensional Farey summation algor…
It is known that for a variety of choices of metrics, including the standard bottleneck distance, the space of persistence diagrams admits geodesics. Typically these existence results produce geodesics that have the form of a convex…
Motivated by the similarities between the theory of spherical $t$-designs and that of $t$-designs in $Q$-polynomial association schemes, we study two versions of relative $t$-designs, the counterparts of Euclidean $t$-designs for $P$-…
We discuss a proposal for a continued fraction-like algorithm to determine simultaneous rational approximations to $d$ real numbers $\alpha_1,\ldots,\alpha_d$. It combines an algorithm of Hermite and Lagarias with ideas from LLL-reduction.…
We solve a problem posed by Cardinali and Sastry [2] about factorization of $2$-covers of finite classical generalized quadrangles. To that end, we develop a general theory of cover factorization for generalized quadrangles, and in…
In a recent paper (Asci \textit{et al.}, 2008) it has been shown that certain random continued fractions have a density which is a product of a beta density and a hypergeometric function $_{2}F_{1}$. In the present paper we fully exploit a…
We present general reduction procedures for Courant, Dirac and generalized complex structures, in particular when a group of symmetries is acting. We do so by taking the graded symplectic viewpoint on Courant algebroids and carrying out…
A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…
We first survey the current state of the art concerning the dynamical properties of multidimensional continued fraction algorithms defined dynamically as piecewise fractional maps and compare them with algorithms based on lattice reduction.…
Using the slow triangle map (a type of multi-dimensional continued fraction algorithm), we exhibit a method for generating any number of new identities for subsets of integer partitions.
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
Kazhdan-Lusztig-Stanley polynomials are a combinatorial generalization of Kazhdan-Lusztig polynomials of for Coxeter groups that include g-polynomials of polytopes and Kazhdan-Lusztig polynomials of matroids. In the cases of Weyl groups,…
This paper is the second part of a threefold article, aimed at solving numerically the Poisson problem in three-dimensional prismatic or axisymmetric domains. In the first part of this series, the Fourier Singular Complement Method was…
We propose a fast greedy algorithm to compute sparse representations of signals from continuous dictionaries that are factorizable, i.e., with atoms that can be separated as a product of sub-atoms. Existing algorithms strongly reduce the…
We consider the Grassmannian $\mathbb{G}r(k,n)$ of $(k+1)$-dimensional linear subspaces of $V_n=H^0({\P^1},\O_{\P^1}(n))$. We define $\frak{X}_{k,r,d}$ as the classifying space of the $k$-dimensional linear systems of degree $n$ on $\P^1$…
The theory of multidimensional persistence captures the topology of a multifiltration -- a multiparameter family of increasing spaces. Multifiltrations arise naturally in the topological analysis of scientific data. In this paper, we give a…
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
In this paper, we study the dimension theory of a class of piecewise affine systems in euclidean spaces suggested by Michael Barnsley, with some applications to the fractal image compression. It is a more general version of the class…
A new powerful method to calculate Feynman diagrams is proposed. It consists in setting up a Taylor series expansion in the external momenta squared (in general multivariable). The Taylor coefficients are obtained from the original diagram…
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. In the seventh paper, the usual structural analysis of beams on an elastic foundation…
We show that the fractonic dipole-conserving algebra can be obtained as an Aristotelian (and pseudo-Carrollian) contraction of the Poincar\'e algebra in one dimension higher. Such contraction allows to obtain fracton electrodynamics from a…