Related papers: Polynomiality of factorizations in reflection grou…
We show that any element of the special linear group $SL_2(R)$ is a product of two exponentials if the ring $R$ is either the ring of holomorphic functions on an open Riemann surface or the disc algebra. This is sharp: one exponential…
The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…
We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.
Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…
In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, such as the elementary, homogeneous, and…
We study the factorization of the numbers $N = X^2+c$, where $c$ is a fixed constant, and this independently of the value of gcd$(X,c)$. We prove the existence of a family of sequences with arithmetic difference $(U_n, Z_n)$ generating…
Extending work of J. Raleigh, we compute polynomials $P_{n,F}(x)$ associated to certain families $F = \{f_m\}_{m = 3, 4, ...}$ of modular forms for Hecke groups $G(\lambda_m)$ with the property that $P_{n,F}(m)$ is the $n^{th}$ coefficient…
A group $G$ is said to be factorized into subsets $A_1, A_2, \ldots, A_s\subseteq G$ if every element $g$ in $G$ can be uniquely represented as $g=g_1g_2\ldots g_s$, where $g_i\in A_i$, $i=1,2,\ldots,s$. We consider the following…
In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…
We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…
We propose an alternative method to factorize an integer by using three harmonic oscillators. These oscillators are coupled together via specific Kerr nonlinear interactions. This method can be applied even if two harmonic oscillators are…
The article presents results on the well-known problem concerning the structure of integer polynomials $p_n(z; x, y)$, which define multiplication laws in $n$-valued groups $\mathbb{G}_n$ over the field of complex numbers $\mathbb{C}$. We…
This paper defines the partition algebra for complex reflection group $G(r,p,n)$ acting on $k$-fold tensor product $(\mathbb{C}^n)^{\otimes k}$, where $\mathbb{C}^n$ is the reflection representation of $G(r,p,n)$. A basis of the centralizer…
The numerical construction of polynomials in the product representation (as used for instance in variants of the multiboson technique) can become problematic if rounding errors induce an imprecise or even unstable evaluation of the…
Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…
Let $\S $ be an arbitrary subset of $R^n$ where $R$ is a domain with the field of fractions $\K$. Denote the ring of polynomials in $n$ variables over $\K$ by $\K[\x].$ The ring of integer-valued polynomials over $\S,$ denoted by…
Let $R$ be a local ring and $M,N$ be finitely generated $R$-modules. The complexity of $(M,N)$, denoted by $\cxx RMN$, measures the polynomial growth rate of the number of generators of the modules $\Ext nRMN$. In this paper we study…
This paper studies Symmetric Determinantal Representations (SDR) in characteristic 2, that is the representation of a multivariate polynomial P by a symmetric matrix M such that P=det(M), and where each entry of M is either a constant or a…
Let $q = p^s$ be a power of a prime number $p$ and let $\mathbb{F}_q$ be the finite field with $q$ elements. In this paper we obtain the explicit factorization of the cyclotomic polynomial $\Phi_{2^nr}$ over $\mathbb{F}_q$ where both $r…
We introduce and investigate the category of factorization of a multiplicative, commutative, cancellative, pre-ordered monoid $A$, which we denote $\mathcal{F}(A)$. The objects of $\mathcal{F}(A)$ are factorizations of elements of $A$, and…