Related papers: Parking functions and vertex operators

The purpose of this paper is to give an overview of the operator structure of frames, where the operator belongs to certain classes of linear operators and the element belongs to $H$. We discuss the size of the set of such elements. Also,…

We introduce analogues of algebraic groups called algebraic racks, which are pointed rack objects in the category of schemes over a ground field. Addressing a problem of Loday, we construct functors assigning left and right Leibniz algebras…

Given a positive-integer-valued vector $u=(u_1, \dots, u_m)$ with $u_1<\cdots<u_m$. A $u$-parking function of length $m$ is a sequence $\pi=(\pi_1, \dots, \pi_m)$ of positive integers whose non-decreasing rearrangement $(\lambda_1, \dots,…

We introduce Besov and Triebel--Lizorkin spaces on a manifold with boundary adapted to H\"ormander vector fields, near a so-called non-characteristic point of the boundary. We prove sharp results in these spaces for the corresponding…

We develop a natural generalization of vector-valued frame theory, we term operator-valued frame theory, using operator-algebraic methods. This extends work of the second author and D. Han which can be viewed as the multiplicity one case…

Symmetric functions provide one of the most efficient tools for combinatorial enumeration, in the context of objects that may be acted upon by permutations. Only assuming a basic knowledge of linear algebra, we introduce and describe the…

In this paper, we explore parking distributions on caterpillar trees, focusing on two primary statistics: the number of lucky cars and the frequency with which cars prefer specific parking spaces. We use first-return decomposition to reveal…

Recall that $\alpha=(a_1,a_2,\ldots,a_n)\in[n]^n$ is a parking function if its nondecreasing rearrangement $\beta=(b_1,b_2,\ldots,b_n)$ satisfies $b_i\leq i$ for all $1\leq i\leq n$. In this article, we study parking functions based on…

We answer an open problem of arXiv:1204.1760 and arXiv:1205.4293, extending their work to irreducible well--generated complex reflection groups $W$. We define a combinatorial $W$-noncrossing parking space and an algebraic $W$-parking space…

We continue our earlier investigation on generalized reproducing kernels, in connection with the complex geometry of $C^*$- algebra representations, by looking at them as the objects of an appropriate category. Thus the correspondence…

We represent vector bundles over a regular algebraic curve as pairs of lattices over the maximal orders of its function field and we give polynomial time algorithms for several tasks: computing determinants of vector bundles, kernels and…

In this work we describe the mathematical foundations used in the construction of primary fields of minimal models of conformal field theory. The work contains two parts: In the first part we give a description of Verma and Fock modules for…

We revisit and connect several notions of algebraic multiplicities of zeros of analytic operator-valued functions and discuss the concept of the index of meromorphic operator-valued functions in complex, separable Hilbert spaces.…

We consider frames F in a given Hilbert space, and we show that every F may be obtained in a constructive way from a reproducing kernel and an orthonormal basis in an ambient Hilbert space. The construction is operator-theoretic, building…

The problem of constructing twisted modules for a vertex operator algebra and an automorphism has been solved in particular in two contexts. One of these two constructions is that initiated by the third author in the case of a lattice…

Let V be a simple vertex operator algebra and G a finite automorphism group. Then there is a natural right G-action on the set of all inequivalent irreducible V-modules. Let S be a finite set of inequivalent irreducible V-modules which is…

This paper provides an exploration of parking functions, a classical combinatorial object. We present two viewpoints on their structure and properties: through poset of noncrossing partitions and polytopes.

Interval parking functions are a generalization of parking functions in which cars have an interval preference for their parking. We generalize this definition to parking functions with $n$ cars and $m\geq n$ parking spots, which we call…

We introduce and study the notion of orthosymmetric spaces over an Archimedean vector lattice as a generalization of finite-dimentional Euclidean inner spaces. A special attention has been paid to linear operators on these spaces.

We study the subalgebra of the lattice vertex operator algebra $V_{\sqrt{2}A_2}$ consisting of the fixed points of an automorphism which is induced from an order 3 isometry of the root lattice $A_2$. We classify the simple modules for the…