Related papers: Representing partition lattices through FCA
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
Integrable differential identities, together with ensemble-specific initial conditions, provide an effective approach for the characterisation of relevant observables and state functions in random matrix theory. We develop this approach for…
This article investigates atomic decompositions in geometric lattices isomorphic to the partition lattice $\Pi(X)$ of a finite set $X$, a fundamental structure in lattice theory and combinatorics. We explore the role of atomicity in these…
In this paper, we establish that the number of partitions of a natural number with positive odd rank is equal to the number of two-color partitions (red and blue), where the smallest part is even (say $2n$) and all red parts are even and…
A map $f{:}\,[0,1)\to [0,1)$ is a {\it piecewise contraction of $n$ intervals} ($n$-PC) if there exist $0<\lambda<1$ and a partition of $[0,1)$ into intervals $I_1,\ldots,I_n$ such that $f\vert_{I_i}$ is $\lambda$-Lipschitz for every $1\le…
Zeckendorf proved that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, and later researchers showed that the distribution of the number of summands needed for such decompositions of integers in…
In the paper, we make use of Manton's analytical method to investigate the force between kink and the anti-kink with large distance in $1+1$ dimensional field theory. The related potential has infinite order corrections of exponential…
The general solution of the two-dimensional integrable generalization of the f-Toda chain with fixed ends is explicitly presented in terms of matrix elements of various fundamental representations of the SL(n|n-1) supergroup. The dominant…
Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of…
We prove that the very simple lattices which consist of a largest, a smallest and $2n$ pairwise incomparable elements where $n$ is a positive integer can be realized as the lattices of intermediate subfactors of finite index and finite…
We prove that if $\Gamma$ is an icc irreducible lattice in a product of connected non-compact rank one simple Lie groups with finite center, then the II$_1$ factor $L(\Gamma)$ is prime. In particular, we deduce that the II$_1$ factors…
When W is a finite reflection group, the noncrossing partition lattice NCP_W of type W is a rich combinatorial object, extending the notion of noncrossing partitions of an n-gon. A formula (for which the only known proofs are case-by-case)…
A fundamental identity in the representation theory of the partition algebra is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young…
Spatial chaos as a phenomenon of ultimate complexity requires the efficient numerical algorithms. For this purpose iterative low-dimensional maps have demonstrated high efficiency. Natural generalization of Feigenbaum and Ikeda maps may…
Integer partitions express the different ways that a positive integer may be written as a sum of positive integers. Here we explore the analytic properties of a new polynomial $f_\lambda(x)$ that we call the partition polynomial for the…
Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. For a $k$-tuple of positive integers $\underline{\lambda} = (\lambda_{1}, \dots{} ,\lambda_{k})$ with $1 \le \lambda_{1} < \lambda_{2} < \dots{} < \lambda_{k}$, we…
We propose the fundamental and two dimensional representation of the Lorentz groups on a (3+1)-dimensional hypercubic lattice, from which representations of higher dimensions can be constructed. For the unitary representation of the…
We show the existence of a series of transforms that capture several structures that underlie higher-dimensional partitions. These transforms lead to a sequence of triangles whose entries are given combinatorial interpretations as the…