Related papers: Computing Hilbert class polynomials with the Chine…
In this paper we present an effective method for computing certain real coefficients $\lambda_{n}$ which appear in a criterion for the Riemann hypothesis proved by Xian-Jin Li. With the use of this method a sequence of over three-thousand…
We study the spaces $Q_m$ of $m$-quasi-invariant polynomials of the symmetric group $S_n$ in characteristic $p$. Using the representation theory of the symmetric group we describe the Hilbert series of $Q_m$ for $n=3$, proving a conjecture…
We present an algorithm for computing circuit polynomials in the algebraic rigidity matroid $\mathcal{A}(\text{CM}_n)$ associated to the Cayley-Menger ideal CM$_n$ for $n$ points in 2D. It relies on combinatorial resultants, a new operation…
The solutions of the equation $f^{(p-1)} + f^p = h^p$ in the unknown function $f $over an algebraic function field of characteristic $p$ are very closely linked to the structure and factorisations of linear differential operators with…
In Ehrhart theory, the well-known sign pattern problem asks: given a positive integer $d\geq 3$ and integers $1 \leq i_1 < \cdots < i_k \leq d-2$, does there exist a $d$-dimensional integral polytope $\mathcal{P}$ such that in its Ehrhart…
We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can…
The classic algorithm of Viterbi computes the most likely path in a Hidden Markov Model (HMM) that results in a given sequence of observations. It runs in time $O(Tn^2)$ given a sequence of $T$ observations from a HMM with $n$ states.…
In recent work, Darmon, Pozzi and Vonk explicitly construct a modular form whose spectral coefficients are $p$-adic logarithms of Gross-Stark units and Stark-Heegner points. Here we describe how this construction gives rise to a practical…
The problem of robustly reconstructing an integer vector from its erroneous remainders appears in many applications in the field of multidimensional (MD) signal processing. To address this problem, a robust MD Chinese remainder theorem…
In this paper we present a generalization of the classical Hermite polynomials to the framework of Clifford-Dunkl operators. Several basic properties, such as orthogonality relations, recurrence formulae and associated differential…
We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…
Under the Riemann Hypothesis for Dirichlet L-functions, we improve on the error term in a smoothed version of an estimate for the density of elliptic curves with square-free $\Delta=D/16$, where D is the discriminant, by T.D. Browning and…
We present a new technique for computing Hilbert series of N=1 supersymmetric QCD in four dimensions with unitary and special unitary gauge groups. We show that the Hilbert series of this theory can be written in terms of determinants of…
In this paper, we investigate $\mathbb T^d$-invariant Hilbert modules $\mathscr H$ over the polynomial ring $\mathbb C[z_1, \ldots, z_d]$ and their quotients, with primary emphasis on the classification of subnormal quotient modules of the…
We offer a Maple-procedure for computing of the Hilbert polynomials of the algebras of $SL_2$-invariants
We develop the first algorithms for computing the Skyscraper Invariant [FJNT24]. This is a filtration of the classical rank invariant for multiparameter persistence modules defined by the Harder-Narasimhan filtrations along every central…
A first order differential equation with a periodic operator coefficient acting in a pair of Hilbert spaces is considered. This setting models both elliptic equations with periodic coefficients in a cylinder and parabolic equations with…
Space-filling curves like the Hilbert-curve, Peano-curve and Z-order map natural or real numbers from a two or higher dimensional space to a one dimensional space preserving locality. They have numerous applications like search structures,…
We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…
We apply the holonomic gradient method (HGM) introduced by [9] to the calculation of orthant probabilities of multivariate normal distribution. The holonomic gradient method applied to orthant probabilities is found to be a variant of…