English
Related papers

Related papers: A generalization of boson normal ordering

200 papers

A new class of operators, larger than $C$-symmetric operators and different than normal one, named $C$--normal operators is introduced. Basic properties are given. Characterizations of this operators in finite dimensional spaces using a…

Functional Analysis · Mathematics 2020-01-01 Marek Ptak , Katarzyna Simik , Anna Wicher

We introduce a family of generalized Broughton polynomials and compute the characteristic varieties of complement of a curve arrangement defined by fibers of some generalized Broughton polynomials

Algebraic Geometry · Mathematics 2012-09-03 Nguyen Tat Thang

The generalized massive Thirring model (GMT) with $N_{f}(=$number of positive roots of $su(n)$) fermion species is bosonized in the context of the functional integral and operator formulations and shown to be equivalent to a generalized…

High Energy Physics - Theory · Physics 2007-05-23 Harold Blas

The s-ordered form of any product of single-mode boson creation and annihilation operators, containing only a single annihilator, is computed explicitly. The s-ordering concept originated in quantum optics, but subsumes normal, symmetric…

Quantum Physics · Physics 2025-12-05 Robert S. Maier

Symmetric Hilbert spaces such as the bosonic and the fermionic Fock spaces over some `one particle space' $\K$ are formed by certain symmetrization procedures performed on the full Fock space. We investigate alternative ways of…

Mathematical Physics · Physics 2011-06-23 Madalin Guta , Hans Maassen

We introduce an asymmetric operator of generalised translation, define the generalised modulus of smoothness by its means, and obtain the direct and inverse theorems in approximation theory for it.

Functional Analysis · Mathematics 2012-08-31 Mikhail K. Potapov , Faton M. Berisha

We generalize the embedding formalism for conformal field theories to the case of general operators with mixed symmetry. The index-free notation encoding symmetric tensors as polynomials in an auxiliary polarization vector is extended to…

High Energy Physics - Theory · Physics 2015-09-03 Miguel S. Costa , Tobias Hansen

We study the general theory of Frobenius algebras with group actions. These structures arise when one is studying the algebraic structures associated to a geometry stemming from a physical theory with a global finite gauge group, i.e.…

Algebraic Geometry · Mathematics 2007-05-23 Ralph M. Kaufmann

We study composition operators on the Fock spaces $\mathcal{F}^2_\alpha(\mathbb{C}^n)$, problems considered include the essential norm, normality, spectra, cyclicity and membership in the Schatten classes. We give perfect answers for these…

Complex Variables · Mathematics 2016-08-23 Liangying Jiang , Gabriel T. Prajitura , Ruhan Zhao

A planar order is a special linear extension of the edge poset (partially ordered set) of a processive plane graph. The definition of a planar order makes sense for any finite poset and is equivalent to the one of a conjugate order. Here it…

Combinatorics · Mathematics 2023-08-21 Xuexing Lu

We introduce certain linear positive operators and study some approximation properties of these operators in the space of functions, continuous on a compact set, of two variables. We also find the order of this approximation by using…

Classical Analysis and ODEs · Mathematics 2007-09-24 Fatma Tasdelen , Ali Olgun , Gulen Bascanbaz-Tunca

Resolvent compositions were recently introduced as monotonicity-preserving operations that combine a set-valued monotone operator and a bounded linear operator. They generalize in particular the notion of a resolvent average. We analyze the…

Functional Analysis · Mathematics 2026-01-30 Diego J. Cornejo

We investigate the combinatorics of the general formulas for the powers of the operator $h \partial^k$, where $h$ is a central element of a ring and $\partial$ is a differential operator. This generalizes previous work on the powers of…

Combinatorics · Mathematics 2020-04-14 Emmanuel Briand , Samuel A. Lopes , Mercedes Rosas

Sorting algorithms are fundamental to computer science, and their correctness criteria are well understood as rearranging elements of a list according to a specified total order on the underlying set of elements. As mathematical functions,…

Logic in Computer Science · Computer Science 2025-12-09 Vikraman Choudhury , Wind Wong

We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…

Combinatorics · Mathematics 2025-11-12 Andrew Li , Hua Wang

In a recent series of communications we have shown that the reordering problem of bosons leads to certain combinatorial structures. These structures may be associated with a certain graphical description. In this paper, we show that there…

Symbolic Computation · Computer Science 2016-08-16 Gérard Henry Edmond Duchamp , Pawel Blasiak , Andrzej Horzela , Karol A. Penson , Allan I. Solomon

Generalized Bose operators correspond to reducible representations of the harmonic oscillator algebra. We demonstrate their relevance in the construction of topologically non-trivial solutions in noncommutative gauge theories, focusing our…

High Energy Physics - Theory · Physics 2012-02-21 Nirmalendu Acharyya , Nitin Chandra , Sachindeo Vaidya

Since their introduction by Beilinson-Drinfeld \cite{BD,Opers1}, opers have seen several generalizations. In \cite{BSY} a higher rank analog was studied, named {generalized $B$-opers}, where the successive quotients of the oper filtration…

Algebraic Geometry · Mathematics 2021-05-25 Indranil Biswas , Laura P. Schaposnik , Mengxue Yang

In this paper an asymmetrical operator of generalised translation is introduced, the generalised modulus of smoothness is defined by its means and the direct and inverse theorems in approximation theory are proved for that modulus. ----- V…

Functional Analysis · Mathematics 2012-09-03 Mikhail K. Potapov , Faton M. Berisha

A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…

Combinatorics · Mathematics 2026-03-12 Juliann Geraci , Alexander B. Kunin , Alexandra Seceleanu