相关论文: Transport of patterns by Burge transpose

We study the structure of multiple correlation sequences defined by measure preserving actions of commuting transformations. When the iterates of the transformations are integer polynomials we prove that any such correlation sequence is the…

In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…

Traveling fronts and stationary localized patterns in bistable reaction-diffusion systems have been broadly studied for classical continuous media and regular lattices. Analogs of such non-equilibrium patterns are also possible in networks.…

Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are…

Inspired by the success of Transformer-based models in natural language processing, this paper investigates their potential as foundation models for network traffic analysis. We propose a unified pre-training and fine-tuning pipeline for…

In the context of the genome rearrangement problem, we analyze two well known models, namely the block transposition and the prefix block transposition models, by exploiting the connection with the notion of permutation pattern. More…

In this paper, we introduce plane permutations, i.e. pairs $\mathfrak{p}=(s,\pi)$ where $s$ is an $n$-cycle and $\pi$ is an arbitrary permutation, represented as a two-row array. Accordingly a plane permutation gives rise to three distinct…

Despite recent advances in population-based structural health monitoring (PBSHM), knowledge transfer between highly-disparate structures (i.e., heterogeneous populations) remains a challenge. The current work proposes that heterogeneous…

Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers…

Neural machine translation (NMT) models typically operate with a fixed vocabulary, but translation is an open-vocabulary problem. Previous work addresses the translation of out-of-vocabulary words by backing off to a dictionary. In this…

A descent $k$ of a permutation $\pi=\pi_{1}\pi_{2}\dots\pi_{n}$ is called a big descent if $\pi_{k}>\pi_{k+1}+1$; denote the number of big descents of $\pi$ by $\operatorname{bdes}(\pi)$. We study the distribution of the…

In this note we make use of some properties of vector fields on a manifold to give an alternate proof to [3] for the equivalence between connections and parallel transport on vector bundles over manifolds. Out of the proof will emerge a new…

We emphasize that construction of travelling wave solutions for partial differential equations is a problem of considerable interest and thus introduce a simple algebraic method to generate such solutions for equations in the Burgers…

Compartmentalization into biochemically distinct organelles constantly exchanging material is one of the hallmarks of eukaryotic cells. In the most naive picture of inter-organelle transport driven by concentration gradients, concentration…

We give a transfer theorem for teleportation based on twisting the entanglement measurement. This allows one to say what local unitary operation must be performed to complete the teleportation in any situation, generalizing the scheme to…

The theory of optimal transportation has developed into a powerful and elegant framework for comparing probability distributions, with wide-ranging applications in all areas of science. The fundamental idea of analyzing probabilities by…

Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these objects had a natural involution which was carried equivariantly by the known bijections, and the…

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…

This chapter is a contribution in the "Handbook of Applications of Chaos Theory" ed. by Prof. Christos H Skiadas. The chapter is organized as follows. First we study the statistical properties of combs and explain how to reduce the effect…

This paper develops techniques to study the number of descents in random permutations via martingales. We relax an assumption in the Berry-Esseen theorem of Bolthausen (1982) to extend the theorem's scope to martingale differences of…