Related papers: Short rational generating functions for lattice po…

We give an algorithm to determine finitely many generators for a subgroup of finite index in the unit group of an integral group ring $\mathbb{Z} G$ of a finite nilpotent group $G$, this provided the rational group algebra $\mathbb{Q} G$…

In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…

The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…

We consider the problem of counting lattice points contained in domains in $\mathbb{R}^d$ defined by products of linear forms and we show that the normalized discrepancies in these counting problems satisfy non-degenerate Central Limit…

In this paper we present the first known deterministic algorithm for the construction of multiple rank-1 lattices for the approximation of periodic functions of many variables. The algorithm works by converting a potentially large…

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…

The paper presents a new algorithmic construction of a finite generating set of rational invariants for the rational action of an algebraic group on the affine space. The construction provides an algebraic counterpart of the moving frame…

In this paper we present a novel project-and-lift approach to compute the set of minimal generators of the semigroup $(\Lambda\cap\R^n_+,+)$ for lattices $\Lambda\subseteq\Z^n$. This problem class includes the computation of Hilbert bases…

Let $G$ be a semisimple algebraic group. We develop a machinery for manipulation and manufacture of well-rounded families $\left\{ \mathcal{B}_{T}\right\} _{T>0}\subset G$ as they were defined in a work by A. Gorodnik and A. Nevo. The…

We extend the scope of analytic combinatorics to classes containing objects that have irrational sizes. The generating function for such a class is a power series that admits irrational exponents (which we call a Ribenboim series). A…

Assume $k$ is a field and $R$ is a smooth $k$-algebra of dimension $d$. If $P$ is a projective module of rank $r$, then it is well-known that $P$ can be generated by $r+d$-elements (Forster--Swan). Under suitable assumptions on $r$ and $d$,…

We study a reproducing kernel Hilbert space of functions defined on the positive integers and associated to the binomial coefficients. We introduce two transforms, which allow us to develop a related harmonic analysis in this Hilbert space.…

We present a new approach to constructing unconditional pseudorandom generators against classes of functions that involve computing a linear function of the inputs. We give an explicit construction of a pseudorandom generator that fools the…

Let X be a closed subscheme and let HF(X,-) and hp(X,-) denote, respectively, the Hilbert function and the Hilbert polynomial of X. We say that X has bipolynomial Hilbert function if HF(X,d)=min{hp(P^n,d),hp(X,d)} for every non-negative…

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

The use of operational methods of different nature is shown to be a fairly powerful tool to study different problems regarding the theory of Legendre and Legendre-like polynomials. We show how the use of the well known integral…

We investigate meandric systems with a large number of loops using tools inspired by free probability. For any fixed integer $r$, we express the generating function of meandric systems on $2n$ points with $n-r$ loops in terms of a finite…

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…

Let a polytope $P$ be defined by a system $A x \leq b$. We consider the problem of counting the number of integer points inside $P$, assuming that $P$ is $\Delta$-modular, where the polytope $P$ is called $\Delta$-modular if all the rank…

Given a model of the theory of the real field with restricted analytic functions such that its value group has finite archimedean rank we show how one can extend the restricted logarithm to a global logarithm with values in the polynomial…