Related papers: Maximal chain descent orders
An order parameter, termed the maximal row correlation, is proposed for classical spin systems. Monte Carlo simulations on various Potts models suggest that this order parameter is applicable to a broad range of spin systems, including…
Motivated by Stanley's results in \cite{St02}, we generalize the rank of a partition $\lambda$ to the rank of a shifted partition $S(\lambda)$. We show that the number of bars required in a minimal bar tableau of $S(\lambda)$ is max$(o, e +…
For a given finite poset $P$, $La(n,P)$ denotes the largest size of a family $\mathcal{F}$ of subsets of $[n]$ not containing $P$ as a weak subposet. We exactly determine $La(n,P)$ for infinitely many $P$ posets. These posets are built from…
A specialization semilattice is a join semilattice together with a coarser preorder $ \sqsubseteq $ satisfying an appropriate compatibility condition. If $X$ is a topological space, then $(\mathcal P(X), \cup, \sqsubseteq )$ is a…
In this work, we discuss completeness for the lattice orders of first and second order stochastic dominance. The main results state that, both, first and second order stochastic dominance induce Dedekind super complete lattices,…
We estimate the size of a labelled tree by comparing the amount of (labelled) nodes with the size of the set of labels. Roughly speaking, a exponentially big labelled tree, is any labelled tree that has an exponential gap between its size,…
The conformations of interacting linear polymers on a dynamical planar random lattice are studied using a random two-matrix model. An exact expression for the partition function of self-avoiding chains subject to attractive contact…
We prove that p.q.-Baer *-ring forms a pseudo lattice with Conrads partial order and also characterize p.q.-Baer *-rings which are lattices. The initial segments of a p.q.-Baer *-ring with Conrads partial order are shown to be orthomodular…
Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…
A finite poset (partially ordered set) $P$ with ${\hat 0}$ is called of distributive type if every interval $[{\hat 0}, a]$, $a \in P$, of $P$ is a distributive lattice. From a viewpoint of ASL's (algebras with straightening laws), the…
We introduce new probabilistic arguments to derive optimal-order central moment bounds in planar directed last-passage percolation. Our technique is based on couplings with the increment-stationary variants of the model, and is presented in…
We present an exposition of the *Chain Bounding Lemma*, which is a common generalization of both Zorn's Lemma and the Bourbaki-Witt fixed point theorem. The proofs of these results through the use of Chain Bounding are amongst the simplest…
Convergence is a crucial issue in iterative algorithms. Damping is commonly employed to ensure the convergence of iterative algorithms. The conventional ways of damping are scalar-wise, and either heuristic or empirical. Recently, an…
The coupled map lattice by Olami {\it et al.} [Phys. Rev. Lett. {\bf 68}, 1244 (1992)] is ``doped'' by letting just {\it one} site have a threshold, $T^{*}_{\rm max}$, bigger than the others. On an $L \times L$ lattice with periodic…
We consider the convex subset $[A,B]$ of all elements between two levels $A$ and $B$ of a finite distributive lattice, as a union of (or covered by) intervals $[a,b]$. A 1988 result of Voigt and Wegener shows that for such convex subsets of…
Let $(\mathcal{P},\leqslant)$ be a finite poset. Define the numbers $a_1,a_2,\ldots$ (respectively, $c_1,c_2,\ldots$) so that $a_1+\ldots+a_k$ (respectively, $c_1+\ldots+c_k$) is the maximal number of elements of $\mathcal{P}$ which may be…
Labeled Latent Dirichlet Allocation (LLDA) is an extension of the standard unsupervised Latent Dirichlet Allocation (LDA) algorithm, to address multi-label learning tasks. Previous work has shown it to perform in par with other…
Boundary labeling is a technique in computational geometry used to label sets of features in an illustration. It involves placing labels along an axis-parallel bounding box and connecting each label with its corresponding feature using…
We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to characterize posets in which some of these mappings coincide. We define special mappings determined…
Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…