Related papers: The Pop-Stack Operator on Ornamentation Lattices
We offer a new perspective and some advances on the 1971 Pearcy--Topping problem: Is every compact operator a commutator of compact operators? Our goal is to analyze and generalize the 1970's work in this area of Joel Anderson combined with…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
We present some results of a numerical investigation of the 't Hooft model with 2,3 and 4 colors, regularized on the lattice with overlap fermions.
Let $\mathcal{L}$ be the space of complex-valued functions $f$ on the set of vertices $T$ of an rooted infinite tree rooted at $o$ such that the difference of the values of $f$ at neighboring vertices remains bounded throughout the tree,…
We present preliminary results of the first lattice QCD calculation of the K -> pi matrix elements of the chromomagnetic operator O_{CM}=g sbar sigma_{munu} G_{munu} d, which appears in the effective Hamiltonian describing Delta S=1…
Regularising the primal formulation of optimal transport (OT) with a strictly convex term leads to enhanced numerical complexity and a denser transport plan. Many formulations impose a global constraint on the transport plan, for instance…
We prove that the set of quadratic growths achievable by integer superharmonic functions on the $F$-lattice, a periodic subgraph of the square lattice with oriented edges, has the structure of an overlapping circle packing. The proof…
We explore some of the properties of a subposet of the Tamari lattice introduced by Pallo, which we call the comb poset. We show that three binary functions that are not well-behaved in the Tamari lattice are remarkably well-behaved within…
We develop a calculus based on graph enumeration for $S_n$-equivariant motivic invariants of graphically stratified moduli spaces. We apply our theory to the Deligne--Mumford moduli space $\overline{\mathcal{M}}_{g, n}$ and to the space of…
We investigate the harmonic-trap control of size and shape of Mott regions in the Fermi Hubbard model on a square optical lattice. The use of Lanczos diagonalization on clusters with twisted boundary conditions, followed by an average over…
We develop a unified view of topological phase transitions (TPTs) in solids by revising the classical band theory with the inclusion of topology. Re-evaluating the band evolution from an "atomic crystal" [a normal insulator (NI)] to a solid…
Operator spreading under unitary time evolution has attracted a lot of attention recently, as a way to probe many-body quantum chaos. While quantities such as out-of-time-ordered correlators (OTOC) do distinguish interacting from…
In this paper, we prove that the set of triangulations of a polygon can be equipped with an order to become a lattice. First, we define this order. In [HN99], authors defined the flip operator and then prove some properties of the graph of…
Let $G$ and $H$ be two groups acting on path connected topological spaces $X$ and $Y$ respectively. Assume that $H$ is finite of order $m$ and the quotient maps $p:X\to X/G$ and $q:Y\to Y/H$ are regular coverings. Then it is well-known that…
We study the structure of pairing order parameter for spin-1/2 fermions with attractive interactions in a square lattice under a uniform magnetic field. Because the magnetic translation symmetry gives a unique degeneracy in the…
A lattice is a partially-ordered set in which every pair of elements has a unique meet (greatest lower bound) and join (least upper bound). We present new data structures for lattices that are simple, efficient, and nearly optimal in terms…
The $m$-Tamari lattices $\mathcal{T}_{n}^{(m)}$ were recently introduced by Bergeron and Pr\'eville-Ratelle as posets on $m$-Dyck paths, and it was shown by Bousquet-M\'elou, Fusy and Pr\'eville-Ratelle that these lattices form intervals in…
The Tamari lattices have been intensely studied since their introduction by Dov Tamari around 1960. However oddly enough, a formula for the number of maximal chains is still unknown. This is due largely to the fact that maximal chains in…
We provide an exact construction of interaction Hamiltonians on a one-dimensional lattice which grow as a polynomial multiplied by an exponential with the lattice site separation as a matrix product operator (MPO), a type of one-dimensional…
Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It finds its roots in the seminal work of Knuth on stack-based sorting algorithms and leads to many links with permutation patterns. We present…