Related papers: Growing Avoiders from the Right: An Operator-Theor…
In this expository article, we describe the recent approach, motivated by ergodic theory, towards detecting arithmetic patterns in the primes, and in particular establishing that the primes contain arbitrarily long arithmetic progressions.…
A recast of the standard residue-class analysis of the 3x+1 (Collatz) map in terms of two elementary operators on arithmetic progressions. The resulting calculus (i) splits any progression into its even and odd subsequences in a single…
For permutations avoiding consecutive patterns from a given set, we present a combinatorial formula for the multiplicative inverse of the corresponding exponential generating function. The formula comes from homological algebra…
We study very smooth functions on the real line, namely Schwartz functions, that satisfy a finite identity relating their translates and a single modulation. Concretely, we assume there is a nontrivial linear combination of translates of…
We introduce a method to evaluate untyped lambda terms by combining the theory of traversals, a term-tree traversing technique inspired from Game Semantics, with judicious use of the eta-conversion rule of the lambda calculus. The traversal…
Commuting integral and differential operators connect the topics of Signal Processing, Random Matrix Theory, and Integrable Systems. Previously, the construction of such pairs was based on direct calculation and concerned concrete special…
Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this…
The pattern avoidance problem seeks to construct a set with large fractal dimension that avoids a prescribed pattern, such as three term arithmetic progressions, or more general patterns, such as finding a set whose Cartesian product avoids…
We propose inference procedures for general nonparametric factorial survival designs with possibly right-censored data. Similar to additive Aalen models, null hypotheses are formulated in terms of cumulative hazards. Thereby, deviations are…
We consider theories characterized by a set of Ward operators which do not form a closed algebra. We impose the Slavnov--Taylor identity built out of the Ward operators and we derive the acceptable breaking of the algebra and the general…
We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…
We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…
We recently published [J. Phys A: Math. Theor. {\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of…
First, we reconstruct Wim Veldman's result that Open Induction on Cantor space can be derived from Double-negation Shift and Markov's Principle. In doing this, we notice that one has to use a countable choice axiom in the proof and that…
This paper is the first in a series of papers developing a functional-analytic theory of vertex (operator) algebras and their representations. For an arbitrary Z-graded finitely-generated vertex algebra (V, Y, 1) satisfying the standard…
The Thirring model, that is, a relativistic field theory of fermions with a contact interaction between vector currents, is studied for dimensionalities 2<d<4 using the 1/N_f expansion, where N_f is the number of fermion species. The model…
We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permutations avoiding the pattern 1324, and an improved upper bound of 13.5. These results depend on a new exact structural characterisation of…
Recently, Hong and Li launched a systematic study of length-four pattern avoidance in inversion sequences, and in particular, they conjectured that the number of $0021$-avoiding inversion sequences can be enumerated by the OEIS entry…
Braided differential operators $\del^i$ are obtained by differentiating the addition law on the braided covector spaces introduced previously (such as the braided addition law on the quantum plane). These are affiliated to a Yang-Baxter…
We study the growing patterns in the rotor-router model formed by adding $N$ walkers at the center of a $L \times L$ two-dimensional square lattice, starting with a periodic background of arrows, and relaxing to a stable configuration. The…