Search arXivSearch

arXiv · 1105.0306

An infinite family of adsorption models and restricted Lukasiewicz paths

Abstract

We define $(k,\ell)$-restricted Lukasiewicz paths, $k\le\ell\in\mathbb{N}_0$, and use these paths as models of polymer adsorption. We write down a polynomial expression satisfied by the generating function for arbitrary values of $(k,\ell)$. The resulting polynomial is of degree $\ell+1$ and hence cannot be solved explicitly for sufficiently large $\ell$. We provide two different approaches to obtain the phase diagram. In addition to a more conventional analysis, we also develop a new mathematical characterization of the phase diagram in terms of the discriminant of the polynomial and a zero of its highest degree coefficient. We then give a bijection between $(k,\ell)$-restricted Lukasiewicz paths and "rise"-restricted Dyck paths, identifying another family of path models which share the same critical behaviour. For $(k,\ell)=(1,\infty)$ we provide a new bijection to Motzkin paths. We also consider the area-weighted generating function and show that it is a q-deformed algebraic function. We determine the generating function explicitly in particular cases of $(k,\ell)$-restricted Lukasiewicz paths, and for $(k,\ell)=(0,\infty)$ we provide a bijection to Dyck paths.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Richard Brak, Gary K Iliev, Thomas Prellberg. 2011-05-03. An infinite family of adsorption models and restricted Lukasiewicz paths. https://doi.org/10.1007/s10955-011-0306-8

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

KEEP EXPLORING

Related papers

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

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