Related papers: Explicit polynomial generators for the ring of qua…
The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) +…
We obtain q-analogues of the Sylvester, Ces\`aro, Pasternack, and Bateman polynomials. We also derive generating functions for these polynomials.
In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials
An irreducible element of a commutative ring is absolutely irreducible if no power of it has more than one (essentially different) factorization into irreducibles. In the case of the ring $\text{Int}(D)=\{f\in K[x]\mid f(D)\subseteq D\}$,…
We describe the qFunctions Mathematica package for $q$-series and partition theory applications. This package includes both experimental and symbolic tools. The experimental set of elements includes guessers for $q$-shift equations and…
We define an overpartition analogue of Gaussian polynomials (also known as $q$-binomial coefficients) as a generating function for the number of overpartitions fitting inside the $M \times N$ rectangle. We call these new polynomials over…
Over an arbitrary field $\mathbb{F}$, let $p$ and $q$ be monic polynomials with degree $2$ in $\mathbb{F}[t]$. The free Hamilton algebra of the pair $(p,q)$ is the free noncommutative algebra in two generators $a$ and $b$ subject only to…
Quantum signal processing (QSP) is a framework which was proven to unify and simplify a large number of known quantum algorithms, as well as discovering new ones. QSP allows one to transform a signal embedded in a given unitary using…
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…
For some numerical semigroup rings of small embedding dimension, namely those of embedding dimension 3, and symmetric or pseudosymmetric of embedding dimension 4, presentations has been determined in the literature. We extend these results…
Counterparts of several classical results of number theory are proven for the ring of polynomials with coefficients in a number field. A theorem of Milnor that determines the Witt ring of a function field is applied to prove an analogue of…
The variety of quasigroups satisfying the identity $(xy)(zy)=xz$ mirrors the variety of groups, and offers a new look at groups and their multiplication tables. Such quasigroups are constructed from a group using right division instead of…
We investigate some weighted integer partitions whose generating functions are double-series. We will establish closed formulas for these $q$-double series and deduce that their coefficients are non-negative. This leads to inequalities…
Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…
In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result…
We find homogeneous counting quasimorphisms that are effective at seeing chains in a free group F. As corollary, we derive that if a group G has an index-d free subgroup, then every element g in G either has stable commutator length at…
We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…
Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…
The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…
We introduce two families of generators (functions) $\mathcal{G}$ that consist of entire and meromorphic functions enjoying a certain periodicity property and contain the classical Gaussian and hyperbolic secant generators. Sharp results…