Related papers: The weighted hook length formula III: Shifted tabl…
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a word by at most a linear factor depending on the group…
When twisting a strip of paper or acetate under high longitudinal tension, one observes, at some critical load, a buckling of the strip into a regular triangular pattern. Very similar triangular facets have recently been observed in…
We consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate…
In this paper we investigate measures over bounded lattices, extending and giving a unifying treatment to previous works. In particular, we prove that the measures of an arbitrary bounded lattice can be represented as measures over a…
Using the Operator Product Expansion for Wilson loops we derive a simple formula giving the discontinuities of the two loop result in terms of the one loop answer. We also argue that the knowledge of these discontinuities should be enough…
A lattice-based model for continuum percolation is applied to the case of randomly located, partially aligned sticks with unequal lengths in 2D which are allowed to cross each other. Results are obtained for the critical number of sticks…
A companion paper to "On knot Floer homology in branched double covers" applied to braided branched loci. We reprove the main result of that paper concerning alternating branched loci when projected to an annulus, without using Khovanov…
Although reasoning about equations over strings has been extensively studied for several decades, little research has been done for equational reasoning on general clauses over strings. This paper introduces a new superposition calculus…
In this paper, we introduce the branched signature model, motivated by the branched rough path framework of [Gubinelli, Journal of Differential Equations, 248(4), 2010], which generalizes the classical geometric rough path. We establish a…
We study simple branched coverings of degree d of the 2- and 3- dimensional sphere branched over oriented links. We demonstrate how to use braid charts to develop embeddings of these into $S^k \times D^2$ for $k=2,3 when $d=2,3$. This is an…
A physical interpretation of the rope simulated by the SONO algorithm is presented. Properties of the tight polygonal knots delivered by the algorithm are analyzed. An algorithm for bounding the ropelength of a smooth inscribed knot is…
We establish weak and strong law of large numbers for a class of branching symmetric Hunt processes with the branching rate being a smooth measure with respect to the underlying Hunt process, and the branching mechanism being general and…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
We report here the measurment of the pion pion scattering length from a study of the kaon to 3 pions dalitz plot.
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s.…
Inversion theorems of Wiener type are essential tools in analysis and number theory. We derive a weighted version of an inversion theorem of Wiener type for general Dirichlet series from that of Edwards from 1957, and we outline an…
The symplectic/orthogonal contents of partitions are related to the dimensions of irreducible representations of symplectic/orthogonal groups. In 2012, motivated by Nekrasov--Okounkov's hook-length formula and Stanley's hook-content…
In this note we prove a weighted version of the Khintchine inequalities.
In this paper we investigate the discrete version of the classical hanging chain problem. We generalize the problem, by allowing for arbitrary mass and length of each link. We show that the shape of the chain can be obtained by solving a…