相关论文: Arrow Relations in Lattices of Integer Partitions

We say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime…

We completely describe presentations of Lie superalgebras with Cartan matrix if they are simple Z-graded of polynomial growth. Such matrices can be neither integer nor symmetrizable. There are non-Serre relations encountered. In certain…

Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…

A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…

The purpose of this paper is twofold. We explore higher property T as an abstract group-theoretic property. In particular, we provide new operator-algebraic characterizations of higher property T. Then we turn to lattices in semisimple Lie…

We classify all the lattices realized as the intersection form of a positive definite four manifold with boundary $S_n^3(K)$ for a knot $K$ in the three sphere and a positive integer $n$ greater than $4g_4(K)+3$. We then use this result to…

In this study, we investigate the lattice angle, which is defined as the angle between two vectors whose components are integers. We focus on the set of angles between a fixed integer vector and other integer vectors. For…

For each positive integer $n$, let $G_n$ be the graph of integer partitions of $n$, where two partitions are adjacent if one is obtained from the other by an elementary transfer of a cell in the Ferrers diagram, followed by reordering.…

We take advantage of a recently established equivalence, between the intermittent dynamics of a deterministic nonlinear map and the scattering matrix properties of a disorderless double Cayley tree lattice of connectivity $K$, to obtain…

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…

The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…

This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…

In this work, we study several equivalence relations induced from the partitions of the sets of words of finite length. We have results on words over finite fields extending the work of Bacher (2002, Europ. J. Combinatorics, {\bf 23},…

Given an arbitrary graph $E$ we investigate the relationship between $E$ and the groupoid $G_E$. We show that there is a lattice isomorphism between the lattice of pairs $(H, S)$, where $H$ is a hereditary and saturated set of vertices and…

We continue to develop a research line initiated in \cite{wollic22}, studying I/O logic from an algebraic approach based on subordination algebras. We introduce the classes of slanted (co-)Heyting algebras as equivalent presentations of…

This is the first one of a series of papers on association of orientations, lattice polytopes, and abelian group arrangements to graphs. The purpose is to interpret the integral and modular tension polynomials of graphs at zero and negative…

We study linear functions on the space of $n \times n$ matrices over a field which preserve or strongly preserve each of Green's equivalence relations ($\mathcal{L}$, $\mathcal{R}$, $\mathcal{H}$ and $\mathcal{J}$) and the corresponding…

We consider the two-dimensional sorted range reporting problem. Our data structure requires O(n lglg n) words of space and O(lglg n + k lglg n) query time, where k is the number of points in the query range. This data structure improves a…

Motivated by Gentzen disjunction elimination rule in his Natural Deduction calculus and reading inequalities with meet in a natural way, we conceive a notion of distributivity for join-semilattices. We prove that it is equivalent to a…

Let $M$ be a T-motive. We introduce the notion of duality for $M$. Main results of the paper (we consider uniformizable $M$ over $F_q[T]$ of rank $r$, dimension $n$, whose nilpotent operator $N$ is 0): 1. Algebraic duality implies analytic…