Related papers: Generating functions for the quotients of numerica…
We find a relation between the genus of a quotient of a numerical semigroup $S$ and the genus of $S$ itself. We use this identity to compute the genus of a quotient of $S$ when $S$ has embedding dimension $2$. We also exhibit identities…
We describe here an experimental method that permits to compute a good candidate for the closed form of a generating function if we know the first few terms of a series. The method is based on integer relations algorithms and uses either…
Using functional calculi theory, we obtain several estimates for $\|\psi(A)g(A)\|$, where $\psi$ is a Bernstein function, $g$ is a bounded completely monotone function and $-A$ is the generator of a holomorphic $C_0$-semigroup on a Banach…
Letting $G=F/R$ be a finitely-presented group, Hopf's formula expresses the second integral homology of $G$ in terms of $F$ and $R$. Expanding on previous work, we explain how to find generators of $H_2(G;\mathbb{F}_p)$. The context of the…
We develop a pseudo-random generator to fool degree-$d$ polynomial threshold functions with respect to the Gaussian distribution. For $c>0$ any constant, we construct a pseudo-random generator that fools such functions to within $\epsilon$…
We study the natural question of constructing pseudorandom generators (PRGs) for low-degree polynomial threshold functions (PTFs). We give a PRG with seed-length log n/eps^{O(d)} fooling degree d PTFs with error at most eps. Previously, no…
We consider the tiling generating functions of semi-hexagons and quartered hexagons with dents on their sides. In general, there are no simple product formulas for these generating functions. However, we show that the modification in the…
Developing explicit pseudorandom generators (PRGs) for prominent categories of Boolean functions is a key focus in computational complexity theory. In this paper, we investigate the PRGs against the functions of degree-$d$ polynomial…
Recently, the concept of generating function has been employed in one-loop reduction. For one-loop integrals encompassing arbitrary tensor ranks and higher-pole contributions, the generating function can be decomposed into a tensor part and…
This is a collection of examples showing how the GAP system can be used to compute information about the probabilistic generation of finite almost simple groups. It includes all examples that were needed for the computational results in the…
Let $G$ be a finitely generated torsion-free pro-$p$ group containing an open free-by-$\mathbb{Z}_p$ pro-$p$ subgroup. We show that the completed group algebra of $G$ over $\mathbb{F}_p$ is a Sylvester domain. Moreover the inner rank of a…
We give two explicit sets of generators of the group of invertible regular functions over QQ on the modular curve Y1(N). The first set of generators is very surprising. It is essentially the set of defining equations of Y1(k) for k <= N/2…
The fact that Schubert polynomials are the weighted counting functions for reduced RC-graphs, also known as reduced pipe dreams, was established using their generating functions inside an appropriate Demazure algebra. Here we investigate…
By solving a control problem and using Malliavin calculus, explicit derivative formula is derived for the semigroup $P_t$ generated by the Gruschin type operator on $\R^{m}\times \R^{d}:$ $$L (x,y)=\ff 1 2 \bigg\{\sum_{i=1}^m \pp_{x_i}^2…
In this short note, we are interested in discussing characteristics of finite generating sets for $\mathcal{F}$, the set of all semiflows with non negative coefficients of a Petri Net. By systematically positioning these results over semi…
The $p$-th power of the logarithm of the Catalan generating function is computed using the Stirling cycle numbers. Instead of Stirling numbers, one may write this generating function in terms of higher order harmonic numbers.
In this paper we present a generating function approach to two counting problems in elementary quantum mechanics. The first is to find the total ways of distributing identical particles among different states. The second is to find the…
For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an…
The restricted partition function $p_{N}(n)$ counts the partitions of $n$ into at most $N$ parts. In the nineteenth century Sylvester showed that these partitions can be expressed as a sum of $k$-periodic quasi-polynomials ($1\leq k\leq N$)…
This paper discusses the approximation by %semigroups of operators of class ($\mathscr{C}_0$) on the sphere and focuses on a class of so called exponential-type multiplier operators. It is proved that such operators form a strongly…