Related papers: Localization for the Anderson Model on Trees with …
Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…
In this paper, we review a few known facts on the coordinate Bethe ansatz. We present a detailed construction of the Bethe ansatz vector $\psi$ and energy $\Lambda$, which satisfy $V \psi = \Lambda \psi$, where $V$ is the the transfer…
We study trees where each successor set is equipped with some additional structure. We introduce a family of automaton models for such trees and prove their equivalence to certain fixed-point logics. As a consequence we obtain…
In the present paper we are interested in properties of forcing notions which measure in a sense the distance between the ground model reals and the reals in the extension. We look at the ways the ``new'' reals can be aproximated by ``old''…
Intertwiners between \ade lattice models are presented and the general theory developed. The intertwiners are discussed at three levels: at the level of the adjacency matrices, at the level of the cell calculus intertwining the face…
We explore new connections between complete non-ambiguous trees (CNATs) and permutations. We give a bijection between tree-like tableaux and a specific subset of CNATs. This map is used to establish and solve a recurrence relation for the…
For the family of graded lattice ideals of dimension 1, we establish a complete intersection criterion in algebraic and geometric terms. In positive characteristic, it is shown that all ideals of this family are binomial set theoretic…
The last in-tree recognition problem asks whether a given spanning tree can be derived by connecting each vertex with its rightmost left neighbor of some search ordering. In this study, we demonstrate that the last-in-tree recognition…
We give a detailed description of the nested algebraic Bethe ansatz. We consider integrable models with a $\mathfrak{gl}_3$-invariant $R$-matrix as the basic example, however, we also describe possible generalizations. We give recursions…
We give a combinatorial proof of a recent result of B\'ona by constructing a bijection from the set of all neighbors of leaves of increasing trees of size $n$ to the set of derangements of length $n$.
Elementary arguments show that a tree or forest is determined (up to isomorphism) by binary matroids defined using the adjacency matrix.
We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…
A bijection is constructed between two sets of height restricted lattice paths by means of translating them in two tree classe, namely plane trees and Elena trees. An old bijection between them can be used now for that actual problem.
We develop a new method to compute the exact overlaps between integrable boundary states and on-shell Bethe states for integrable spin chains. Our method is based on the coordinate Bethe Ansatz and does not rely on the "rotation trick" of…
We derive a matrix product representation of the Bethe ansatz state for the XXX and XXZ spin-1/2 Heisenberg chains using the algebraic Bethe ansatz. In this representation, the components of the Bethe eigenstates are expressed as traces of…
We present the exact solution of a family of fragmented Bose-Hubbard models and represent the models as graphs with the condensates in the vertices. The models are solved by the algebraic Bethe ansatz method. We show that the models have…
We provide an analytic theory of Anderson localization on a lattice with a weak short-range correlated disordered potential. Contrary to the general belief we demonstrate that even next-neighbor statistical correlations in the potential can…
Place value numbers, such as the binary or decimal numbers can be represented by the end vertices (leaf or pendant vertices) of rooted symmetrical trees. Numbers that consist of at most a fixed number of digits are represented by vertices…
In this paper we enumerate and give bijections for the following four sets of vertices among rooted ordered trees of a fixed size: (i) first-children of degree $k$ at level $\ell$, (ii) non-first-children of degree $k$ at level $\ell-1$,…
We prove localization (near the bottom of the spectrum) for certain non-stationary variants of the Anderson model in three dimensions. More specifically, we prove a Wegner estimate, which implies localization by existing work. Two key…