Related papers: Compatible rewriting of noncommutative polynomials…
We present several identities with a form of polynomials or rational functions that involve Pochhammer and q-Pochhammer symbols and q-binomials (i.e. Gauss polynomials). All these identities were obtained by some analytical methods based on…
In this paper, we derive formal general formulas for noncommutative exponentiation and the exponential function, while also revisiting an unrecognized, and yet powerful theorem. These tools are subsequently applied to derive counterparts…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
Existing formalisms for the algebraic specification and representation of networks of reversible agents suffer some shortcomings. Despite multiple attempts, reversible declensions of the Calculus of Communicating Systems (CCS) do not offer…
Authentication is a process by which an entity,which could be a person or intended computer,establishes its identity to another entity.In private and public computer networks including the Internet,authentication is commonly done through…
In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…
By viewing non-commutative polynomials, that is, elements in free associative algebras, in terms of linear representations, we generalize Horner's rule to the non-commutative (multivariate) setting. We introduce the concept of Horner…
Transformations which convert between Fermionic modes and qubit operations have become a ubiquitous tool in quantum algorithms for simulating systems. Similarly, collections of Pauli operators might be obtained from solutions of non-local…
In this paper we give some sufficient conditions of analyticity and univalence for functions defined by an integral operator. Next, we refine the result to a quasiconformal extension criterion with the help of the Becker's method. Further,…
We consider kernels of discrete convolution operators or, equivalently, homogeneous solutions of partial difference operators and show that these solutions always have to be exponential polynomials. The respective polynomial space in…
Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…
Let $L$ be a linear symmetric differential operators on $L^{2}\left( \mathbb{R}\right) $ whose domain is the Schwartz test function space, $\mathcal{S}.$ For the majority of this paper, it is assumed that the coefficient of $L$ are…
A key notion bridging the gap between {\it quantum operator algebras} \cite{LZ10} and {\it vertex operator algebras} \cite{Bor}\cite{FLM} is the definition of the commutativity of a pair of quantum operators (see section 2 below). This is…
A practical approach is presented which allows the use of a non-invariant regularization scheme for the computation of quantum corrections in perturbative quantum field theory. The theoretical control of algebraic renormalization over…
The purpose of this paper is to present a new class of operators known as polynomially hypo-EP operators, extending the notation of hypo-EP, $n$-hypo-EP, and polynomially EP. The paper explores numerous properties and characterizations of…
We study the q-analogue of Euler-Maclaurin formula and by introducing a new q-operator we drive to this form. Moreover, approximation properties of q-Bernoulli polynomials is discussed. We estimate the suitable functions as a combination of…
We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial…
A polynomial identity testing algorithm must determine whether a given input polynomial is identically equal to 0. We give a deterministic black-box identity testing algorithm for univariate polynomials of the form $\sum_{j=0}^t c_j…
An operatorial polynomial polyhedron is a set of the form $$B_{\delta}(\mathcal{B}(\mathcal{H}))=\{X\in \mathcal{B}(\mathcal{H})^d : \Vert\delta(X)\Vert<1\}$$ where $\mathcal{B}(\mathcal{H})$ denotes the space of bounded operators on a…
Boolean functions are mathematical objects with numerous applications in domains like coding theory, cryptography, and telecommunications. Finding Boolean functions with specific properties is a complex combinatorial optimization problem…