Related papers: Enumerating Multi-Operator Monomials in Commutativ…
We give two examples of algebras of differential operators associated to families of matrix valued orthogonal polynomials arising from representations of SU$(N+1)$. The first one gives a commutative algebra and the second one a…
Replacing operators with continuous operator-valued functions, we prove time-dependent versions of well-known results on compressions and diagonals of bounded operators. The setting of smooth functions is also addressed. Our results have no…
The Dunkl--Dirac operator is a deformation of the Dirac operator by means of Dunkl derivatives. We investigate the symmetry algebra generated by the elements supercommuting with the Dunkl--Dirac operator and its dual symbol. This symmetry…
We introduce a way to color the regions of a classical knot diagram using ternary operations, so that the number of colorings is a knot invariant. By choosing appropriate substitutions in the algebras that we assign to diagrams, one obtains…
Ternary algebras, constructed from ternary commutators, or as we call them, ternutators, defined as the alternating sum of products of three operators, have been shown to satisfy cubic identities as necessary conditions for their existence.…
We introduce a class of iterated logarithmic Lipschitz spaces $\mathcal{L}^{(k)}$, $k\in\mathbb{N}$, on an infinite tree which arise naturally in the context of operator theory. We characterize boundedness and compactness of the…
In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…
A classical result about unit equations says that if $\Gamma_1$ and $\Gamma_2$ are finitely generated subgroups of $\mathbb C^\times$, then the equation $x+y=1$ has only finitely many solutions with $x\in\Gamma_1$ and $y\in \Gamma_2$. We…
We propose a new approach to extending the notion of commutator and Lie algebra to algebras with ternary multiplication laws. Our approach is based on ternary associativity of the first and second kind. We propose a ternary commutator,…
In this paper, we extend diagrammatic reasoning in monoidal categories with algebraic operations and equations. We achieve this by considering monoidal categories that are enriched in the category of Eilenberg-Moore algebras for a monad.…
We study sequences of bounded operators \((T_n)_{n \ge 0}\) on a complex separable Hilbert space \(\mathcal{H}\) that satisfy a linear recurrence relation of the form $$ T_{n+r} = A_0 T_n + A_1 T_{n+1} + \cdots + A_{r-1} T_{n+r-1}…
We study commutative associative polynomial operations $\mathbb{A}^n\times\mathbb{A}^n\to\mathbb{A}^n$ with unit on the affine space $\mathbb{A}^n$ over an algebraically closed field of characteristic zero. A classification of such…
Monotone operator theory and fixed point theory for nonexpansive mappings are central areas in modern nonlinear analysis and optimization. Although these areas are fairly well developed, almost all examples published are based on…
In this paper, the formal derivative operator defined with respect to context-free grammars is used to prove some properties about binomial coefficients and multifactorial numbers. In addition, we extend the formal derivative operator to…
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…
The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…
We study unfrustrated spin Hamiltonians that consist of commuting tensor products of Pauli matrices. Assuming translation-invariance, a family of Hamiltonians that belong to the same phase of matter is described by a map between modules…
In recent work, Zeilberger and the author used a functional equations approach for enumerating permutations with r occurrences of the pattern 12...k. In particular, the approach yielded a polynomial-time enumeration algorithm for any fixed…
In this paper, we study averaging operators from an algebraic and combinatorial point of view. We first construct free averaging algebras in terms of a class of bracketed words called averaging words. We next apply this construction to…
We study decreasing binary trees in which every vertex with two children is colored red or blue. We construct two bijections. The first, to ordered set partitions into odd-sized blocks each arranged as an alternating permutation, shows that…