Related papers: Higher Order SPT-Functions
A well-known open problem in graph theory asks whether Stanley's chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two non-isomorphic trees. Previous work has proven the…
For a class of integral operators with kernels metric functions on manifold we find some necessary and sufficient conditions to have finite rank. The problem we pose has a stochastic nature and boils down to the following alternative…
Size-Change Termination (SCT) is a method of proving program termination based on the impossibility of infinite descent. To this end we may use a program abstraction in which transitions are described by monotonicity constraints over…
We introduce a lifting of West's stack-sorting map $s$ to partition diagrams, which are combinatorial objects indexing bases of partition algebras. Our lifting $\mathscr{S}$ of $s$ is such that $\mathscr{S}$ behaves in the same way as $s$…
The high-order synchronization was studied in systems driven by external force and in autonomous systems with proper frequency mismatch. Differing from the literature, in this article, we demonstrate the occurrence of high-order (1:2)…
A "blendstring" is a piecewise polynomial interpolant with high-degree two-point Hermite interpolational polynomials on each piece, analogous to a cubic spline. Blendstrings are smoother and can be more accurate than cubic splines, and can…
Network interactions between dynamical units are often subject to time delay. We develop a phase reduction method for delay-coupled oscillator networks. The method is based on rewriting the delay-differential equation as an ordinary…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
The purpose of the paper is to obtain estimates for differences of functions of two pairs of commuting contractions on Hilbert space. In particular, Lipschitz type estimates, H\"older type estimates, Schatten--von Neumann estimates are…
A parking function is a function $\pi:[n]\to [n]$ whose $i$th-smallest output is at most $i,$ corresponding to a parking procedure for $n$ cars on a one-way street. We refine this concept by introducing preference-restricted parking…
Transport equations for even-order structure functions are written for a passive scalar mixing fed by a mean scalar gradient, with a Schmidt number $\mathit{Sc}=1$. Direct numerical simulations (DNS), in a range of Reynolds numbers…
Upper and lower quantum functionals, introduced by Christandl, Vrana and Zuiddam (STOC 2018, J. Amer. Math. Soc. 2023), are families of monotone functions of tensors indexed by a weighting on the set of subsets of the tensor legs. Inspired…
A numerical integrator is presented that computes a symmetric or skew-symmetric low-rank approximation to large symmetric or skew-symmetric time-dependent matrices that are either given explicitly or are the unknown solution to a matrix…
In 2003, Hammond and Lewis defined a statistic on partitions into 2 colors which combinatorially explains certain well known partition congruences mod 5. We give two analogs of Hammond and Lewis's birank statistic. One analog is in terms of…
Derivation of the procedures that can be applied in evaluating two-time correlation function in terms of coherent-state propagator and corresponding Q-function is presented. On the basis that the involved functions are generally exponential…
We consider a particular set of two-point functions in the setting of N = 4 SYM with a defect, dual to the fuzzy-funnel solution for the probe D5-D3-brane system. The two-point functions in focus involve a single trace operator in the…
Size-Change Termination is an increasingly-popular technique for verifying program termination. These termination proofs are deduced from an abstract representation of the program in the form of "size-change graphs". We present algorithms…
Asymmetric combination of logics is a formal process that develops the characteristic features of a specific logic on top of another one. Typical examples include the development of temporal, hybrid, and probabilistic dimensions over a…
Phase reduction is a commonly used techinque for analyzing stable oscillators, particularly in studies concerning synchronization and phase lock of a network of oscillators. In a widely used numerical approach for obtaining phase reduction…
Using the Fitzpatrick function, we characterize the solutions for different classes of deterministic and stochastic differential equations driven by maximal monotone operators (or in particular subdifferential operators) as the minimum…