Related papers: The q-Queens Problem: One-Move Riders on the Recta…
The Multi-class Queueing Network (McQN) arises as a natural multi-class extension of the traditional (single-class) Jackson network. In a single-class network subcriticality (i.e. subunitary nominal workload at every station) entails…
Yang-Mills theories on a 1+1 dimensional cylinder are considered. It is shown that canonical quantization can proceed following different routes, leading to inequivalent quantizations. The problem of the non-free action of the gauge group…
Multiline queues are versatile combinatorial objects that play a key role in understanding the remarkable connection between the asymmetric simple exclusion process (ASEP) on a circle and Macdonald polynomials. Specializing the results of…
A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…
For their bijective proof of the hook-length formula for the number of standard tableaux of a fixed shape Novelli, Pak and Stoyanovskii define a modified jeu de taquin which transforms an arbitrary filling of the Ferrers diagram with…
Let $a_n$ denote the number of ways in which a chess rook can move from a corner cell to the opposite corner cell of an $n \times n \times n$ three-dimensional chessboard, assuming that the piece moves closer to the goal cell at each step.…
Moves in chess games are usually analyzed on a case-by-case basis by professional players, but thanks to the availability of large game databases, we can envision another approach of the game. Here, we indeed adopt a very different point of…
We consider a one parameter family of a PT symmetric two dimensional system with quadratic non-linearities. Such systems are shown to perform periodic oscillations due to existing centers. We describe this systems by constructing a…
This paper presents a more complete version than hitherto published of our explanation of a transition from regular to irregular motions and more generally of the nature of a certain kind of deterministic chaos. To this end we introduced a…
Sextic oscillator in D dimensions is considered as a typical quasi-exactly solvable (QES) model. Usually, its QES N-plets of bound states have to be computed using the coupled Magyari's nonlinear algebraic equations. We propose and describe…
We prove uniqueness and Monge solution results for multi-marginal optimal transportation problems with a certain class of surplus functions; this class arises naturally in multi-agent matching problems in economics. This result generalizes…
In [5], Holroyd, Levine, M\'esz\'aros, Peres, Propp and Wilson characterize recurrent chip-and-rotor configurations for strongly connected digraphs. However, the number of steps needed to recur, and the number of orbits is left open for…
We use QCD sum rules to determine directly the leading-twist non-singlet operator matrix elements based on calculations of three-point correlator functions in configuration space. We find a different result from that obtained by integrating…
We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…
In 1973, J. Moser proposed that his Twist Theorem could be used to show that orbits of the outer billiards map on a sufficiently smooth closed curve were always bounded. Five years later Moser asked the same question for a convex polygon.…
We describe a new regularization of quantum field theory on the noncommutative torus by means of one-dimensional matrix models. The construction is based on the Elliott-Evans inductive limit decomposition of the noncommutative torus…
We study a type of generalized recursive game introduced by Castronova, Chen, and Zumbrun featuring increasing stakes, with an emphasis on continuous guts poker and $1$ v. $n$ coalitions. Our main results are to develop practical numerical…
Quantum computers can potentially solve problems that are computationally intractable on a classical computer in polynomial time using quantum-mechanical effects such as superposition and entanglement. The N-Queens Problem is a notable…
The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very…
Quantum billiards are a key focus in quantum mechanics, offering a simple yet powerful model to study complex quantum features. While the development of algebras for quantum systems is traced from one-dimensional integrable models to…