Related papers: Cluster parking functions

For almost finite groupoids, we study how their homology groups reflect dynamical properties of their topological full groups. It is shown that two clopen subsets of the unit space has the same class in H_0 if and only if there exists an…

Function clones are sets of functions on a fixed domain that are closed under composition and contain the projections. They carry a natural algebraic structure, provided by the laws of composition which hold in them, as well as a natural…

We consider algebras defined over a complete, local and noetherian ground ring. They are gentle algebras in case the ground ring is a field. The unbounded homotopy category of complexes of projective modules is considered. Complexes with…

We show that cluster algorithms for quantum models have a meaning independent of the basis chosen to construct them. Using this idea, we propose a new method for measuring with little effort a whole class of Green's functions, once a…

We prove that every finite connected simplicial complex is homotopy equivalent to the quotient of a contractible manifold by proper actions of a virtually torsion-free group. As a corollary, we obtain that every finite connected simplicial…

We propose a model-based clustering algorithm for a general class of functional data for which the components could be curves or images. The random functional data realizations could be measured with error at discrete, and possibly random,…

Given an $n$-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the $n$-gon (viewed as a disc with $n$…

This paper studies a generalization of parking functions named $k$-Naples parking functions, where backward movement is allowed. One consequence of backward movement is that the number of ascending $k$-Naples is not the same as the number…

This work builds on the notion of record of rooted trees. We provide an alternative definition of parking functions, derive from it a record-preserving bijection between rooted trees and parking functions, and establish a join…

We introduce a generalization of parking functions called $t$-metered $(m,n)$-parking functions, in which one of $m$ cars parks among $n$ spots per hour then leaves after $t$ hours. We characterize and enumerate these sequences for $t=1$,…

An \emph{$(r,k)$-parking function} of length $n$ may be defined as a sequence $(a_1,\dots,a_n)$ of positive integers whose increasing rearrangement $b_1\leq\cdots\leq b_n$ satisfies $b_i\leq k+(i-1)r$. The case $r=k=1$ corresponds to…

We conjecture a characterization of a cluster automorphism as an algebra homomorphism from the cluster algebra to itself that restricts to a bijection between two clusters. This formulation does not require that the map commutes with…

Complex conjugation symmetry breaking and restoration generate two non-orthogonal configurations at the Hartree-Fock level that can capture static correlation naturally. In conjunction with broken spin-symmetry coupled cluster theory, the…

For $\mathbf{b}=(b_1,\dots,b_n)\in \mathbb{Z}_{>0}^n$, a $\mathbf{b}$-parking function is defined to be a sequence $(\beta_1,\dots,\beta_n)$ of positive integers whose nondecreasing rearrangement $\beta'_1\leq \beta'_2\leq \cdots \leq…

We develop a general theory of cluster categories, applying to a 2-Calabi-Yau extriangulated category $\mathcal{C}$ and cluster-tilting subcategory $\mathcal{T}$ satisfying only mild finiteness conditions. We show that the structure theory…

This paper presents a novel framework for enclosing solutions of Poisson's equation based on generalized sub- and super-solutions constructed using fundamental solutions. The conventional definition of sub- and super-solutions based on…

The displacement of a car with respect to a parking function is the number of spots it must drive past its preferred spot in order to park. An $\ell$-interval parking function is one in which each car has displacement at most $\ell$. Among…

We give a full classification of representation types of the subcategories of representations of an $m \times n$ rectangular grid with monomorphisms (dually, epimorphisms) in one or both directions, which appear naturally in the context of…

Given a reflection group $G$ acting on a complex vector space $V$, a reflection map is the composition of an embedding $X \hookrightarrow V$ with the orbit map $V\to\mathbb C^p$ that maps a $G$-orbit to a point. Reflection maps can be very…

A pair $(G,K)$ of a group and its subgroup is called a Gelfand pair if the induced trivial representation of $K$ on $G$ is multiplicity free. Let $(a_j)$ be a sequence of positive integers of length $n$, and let $(b_i)$ be its…