Related papers: Enumerating projections of integer points in unbou…

Nonlinear polynomial selection algorithms for the number field sieve address the problem of constructing polynomials with small coefficients by reducing to instances of the well-studied problem of finding short vectors in lattices. The…

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…

We present an algorithm for computing the set of torsion points satisfying a given system of multivariate polynomial equations. Its complexity is quasilinear in the logarithm of the degree of the input equations and exponential in their…

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

In this article we use the HW maps to solve arbitrary equations f=0, by providing an effective enumeration of the roots of f, as these project on and at the branches of the HW maps. This is just an enumeration of the projection points…

We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…

We reduce the problem of constructing asymptotically good tree codes to the construction of triangular totally nonsingular matrices over fields with polynomially many elements. We show a connection of this problem to Birkhoff interpolation…

This paper investigates the distribution of rational and algebraic points of bounded weighted height in weighted projective spaces over number fields. For a weighted projective space with weights q over a number field k of degree m, we…

In the numerical treatment of large-scale Sylvester and Lyapunov equations, projection methods require solving a reduced problem to check convergence. As the approximation space expands, this solution takes an increasing portion of the…

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal…

We describe a class of fixed polyominoes called $k$-omino towers that are created by stacking rectangular blocks of size $k\times 1$ on a convex base composed of these same $k$-omino blocks. By applying a partition to the set of $k$-omino…

We present algorithms to compute generalized root systems of Nichols algebras of diagonal type and of contragredient Lie superalgebras. As a consequence, we obtain an algorithm to compute the Lyndon words in the Kharchenko PBW basis…

For a positive integer sequence $\boldsymbol{a}=(a_1, \dots, a_{N+1})$, Sylvester's denumerant $E(\boldsymbol{a}; t)$ counts the number of nonnegative integer solutions to $\sum_{i=1}^{N+1} a_i x_i = t$ for a nonnegative integer $t$. It has…

We introduce a generalization of symmetric functions and apply the resulting theory to compute the class in the Grothendieck ring of varieties of the space of geometrically irreducible hypersurfaces of a fixed degree in projective space.

We prove a sharp upper bound on the number of boundary lattice points of a rational polygon in terms of its denominator and the number of interior lattice points, generalizing Scott's inequality. We then give sharp lower and upper bounds on…

Counting integer solutions of linear constraints has found interesting applications in various fields. It is equivalent to the problem of counting lattice points inside a polytope. However, state-of-the-art algorithms for this problem…

In this note we give a short overview on symmetry exploiting techniques in three different branches of polyhedral computations: The representation conversion problem, integer linear programming and lattice point counting. We describe some…

We study a class of integrable nonhomogeneous Lotka-Volterra systems whose quadratic terms are defined by an antisymmetric matrix and whose linear terms consist of three blocks. We provide the Poisson algebra of their Darboux polynomials,…

We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…