Related papers: Higher Order SPT-Functions
In Combinatorics Stirling numbers may be defined in several ways. One such definition is given in [1], where an extensive consideration of Stirling numbers is presented. In this paper an alternative definition of Stirling numbers of both…
Order of magnitude reasoning - reasoning by rough comparisons of the sizes of quantities - is often called 'back of the envelope calculation', with the implication that the calculations are quick though approximate. This paper exhibits an…
We consider SPT-phases with on-site $G$ (where $G$ is any finite group) symmetry for two-dimensional quantum spin systems. We then impose translation invariance in one direction and observe that on top of the $H^3(G,\mathbb{T})$-valued…
Simple nonparametric tests for paired functional data are an understudied area, despite recent advances in similar tests for other types of functional data. While the sign test has received limited treatment, the signed rank-type test has…
Various formulas for currents with arbitrary spin are worked out in general space-time dimension, in the free field limit and, at the bare level, in presence of interactions. As the n-dimensional generalization of the (conformal) vector…
Cluster Perturbation Theory (CPT) is a computationally economic method commonly used to estimate the momentum and energy resolved single-particle Green's function. It has been used extensively in direct comparisons with experiments that…
We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…
In this work, building up on [1] we present momentum space Ward identities related to broken higher spin symmetry as an alternate approach to computing correlators of spinning operators in interacting theories such as the quasi-fermionic…
Andrews, Lewis and Lovejoy introduced the partition function $PD(n)$ as the number of partitions of $n$ with designated summands. In a recent work, Lin studied a partition function $PD_{t}(n)$ which counts the number of tagged parts over…
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,…
Gravitationally collapsed objects are known to be biased tracers of an underlying density contrast. Using symmetry arguments, generalised biasing schemes have recently been developed to relate the halo density contrast $\delta_h$ with the…
For random maps, the expected value of the order (i.e. the period of the sequence of compositional iterates) is approximated asymptotically. It is much smaller than the expected value for the product of the cycle lengths.
It is known that the Grothendieck group of the category of Schur functors is the ring of symmetric functions. This ring has a rich structure, much of which is encapsulated in the fact that it is a "plethory": a monoid in the category of…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
Multiranks and new rank/crank analogs for a variety of partitions are given, so as to imply combinatorially some arithmetic properties enjoyed by these types of partitions. Our methods are elementary relying entirely on the three classical…
We consider the description of second-class constraints in a Lagrangian path integral associated with a higher-order $\Delta$-operator. Based on two conjugate higher-order $\Delta$-operators, we also propose a Lagrangian path integral with…
The purpose of this paper is to explain a certain dichotomy between the information that the past and future values of a multivariate stochastic process carry about the present. More specifically, vector-valued, second-order stochastic…
Petrie symmetric functions $G(k,n)$, also known as truncated homogeneous symmetric functions or modular complete symmetric functions, form a class of symmetric functions interpolating between the elementary symmetric functions $e_n$ and the…
We consider the problem of online scheduling on a single machine in order to minimize weighted flow time. The existing algorithms for this problem (STOC '01, SODA '03, FOCS '18) all require exact knowledge of the processing time of each…
We restrict our attention to space-time point pattern data for which we have a single realisation within a finite region. Second-order characteristics are used to analyse the spatio-temporal structure of the underlying point process. In…