Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/9712266

The Martin Boundary of the Young-Fibonacci Lattice

Frederick M. Goodman·Sergei V. Kerov
View original source ↗Read source document ↗Export metadata ↓

Abstract

We find the Martin boundary for the Young-Fibonacci lattice YF. Along with the lattice of Young diagrams, this is the most interesting example of a differential poset. The Martin boundary construction provides an explicit Poisson-type integral representation of non-negative harmonic functions on YF. The latter are in a canonical correspondence with a set of traces on Okada locally semisimple algebra. The set is known to contain all the indecomposable traces. Presumably, all of the traces in the set are indecomposable, though we have no proof of this conjecture. Using a new explicit product formula for Okada characters, we derive precise regularity conditions under which a sequence of characters of finite-dimensional Okada algebras converges to a character of the infinite-dimensional one.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Frederick M. Goodman, Sergei V. Kerov. 1997-12-30. The Martin Boundary of the Young-Fibonacci Lattice. https://arxiv.org/abs/math/9712266

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗