English
Related papers

Related papers: On blockers in bounded posets

200 papers

We develop Grothendieck's theory of dualizing complexes on finite posets, and its subsequent theory of Cohen-Macaulayness.

Combinatorics · Mathematics 2023-05-10 Fernando Sancho de Salas , Alejandro Torres Sancho

Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…

Logic in Computer Science · Computer Science 2015-12-31 Mikhail A. Babin , Sergei O. Kuznetsov

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…

Logic · Mathematics 2008-07-22 Luigi Santocanale

The aim of the present paper is to generalize the concept of residuated poset, by replacing the usual partial ordering by a generic binary relation, giving rise to relational systems which are residuated. In particular, we modify the…

Logic · Mathematics 2020-04-20 Stefano Bonzio , Ivan Chajda

Several recent papers investigated unbounded convergences in Banach lattices. Combine all unbounded convergences, including unbounded order (norm, absolute weak, absolute weak*) convergence, we characterize L-weakly compact sets, L-weakly…

Functional Analysis · Mathematics 2021-04-06 Zhangjun Wang , Zili Chen , Jinxi Chen

We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite…

Combinatorics · Mathematics 2012-11-20 Mike Develin , Matthew Macauley , Victor Reiner

We prove existence of discrete solitons in infinite parity-time (PT-) symmetric lattices by means of analytical continuation from the anticontinuum limit. The energy balance between dissipation and gain implies that in the anticontinuum…

Pattern Formation and Solitons · Physics 2012-12-17 V. V. Konotop , D. E. Pelinovsky , D. A. Zezyulin

A structure of a complete lattice (in the sense of a poset) is defined on the underlying set of the orhtogonal group of a real Euclidean space, by a construction analogous to that of the weak order of a Coxeter system in terms of its root…

Group Theory · Mathematics 2011-10-21 Annette Pilkington

We prove that there are arbitrarily large indecomposable ordered sets T with a 2-chain C such that the smallest indecomposable proper superset U of C in T is T itself. Subsequently, we characterize all such indecomposable ordered sets T and…

Combinatorics · Mathematics 2018-12-03 Bernd S. W. Schröder

A quantum breather on a translationally invariant one-dimensional anharmonic lattice is an extended Bloch state with two or more particles in a strongly correlated state. We discuss several effects that break the lattice symmetry and lead…

Pattern Formation and Solitons · Physics 2009-11-10 J. C. Eilbeck , F. Palmero

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

Combinatorics · Mathematics 2018-06-12 Mahir Bilen Can , Yonah Cherniavsky

In this article we prove that nonlinear resolvents of infinitesimal generators on bounded and convex subdomains of $\C^n$ are decreasing Loewner chains. Furthermore, we consider the problem of the existence of nonlinear resolvents on…

Complex Variables · Mathematics 2024-02-16 Ikkei Hotta , Sebastian Schleißinger , Toshiyuki Sugawa

Posets are discrete mathematical structures which are ubiquitous in a broad range of data analysis and machine learning applications. Research connecting posets to the data science domain has been ongoing for many years. In this paper, a…

Machine Learning · Computer Science 2024-05-28 Arnauld Mesinga Mwafise

We study the partition function of the six-vertex model in the rational limit on arbitrary Baxter lattices with reflecting boundary. Every such lattice is interpreted as an invariant of the twisted Yangian. This identification allows us to…

Mathematical Physics · Physics 2017-06-28 Rouven Frassek

It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…

Combinatorics · Mathematics 2015-10-20 Stuart Margolis , John Rhodes , Pedro V. Silva

We introduce iposets---posets with interfaces---equipped with a novel gluing composition along interfaces and the standard parallel composition. We study their basic algebraic properties as well as the hierarchy of gluing-parallel posets…

Formal Languages and Automata Theory · Computer Science 2019-10-15 Uli Fahrenberg , Christian Johansen , Georg Struth , Ratan Bahadur Thapa

We generalized the characterization of H-closedness for linearly ordered pospaces as follows: A pospace $X$ without an infinite antichain is an H-closed pospace if and only if $X$ is a directed complete and down-complete poset such that sup…

General Topology · Mathematics 2017-07-19 Tomoo Yokoyama

We describe some open problems related to homology representations of subposets of the partition lattice, beginning with questions first raised in Stanley's work on group actions on posets.

Combinatorics · Mathematics 2015-07-10 Sheila Sundaram

Motivated by recent work on mixtures of classical and free probabilities, we introduce and study the notion of $\epsilon$-noncrossing partitions. It is shown that the set of such partitions forms a lattice, which interpolates as a poset…

Combinatorics · Mathematics 2018-12-06 Kurusch Ebrahimi-Fard , Frederic Patras , Roland Speicher

The fixed point property for finite posets of width 3 and 4 is studied in terms of forbidden retracts. The ranked forbidden retracts for width 3 and 4 are determined explicitly. The ranked forbidden retracts for the width 3 case that are…

Combinatorics · Mathematics 2007-05-23 Jonathan David Farley
‹ Prev 1 8 9 10 Next ›