English
Related papers

Related papers: Order Preserving Maps of Posets

200 papers

For a distributive join-semilattice S with zero, a S-valued poset measure on a poset P is a map m:PxP->S such that m(x,z) <= m(x,y)vm(y,z), and x <= y implies that m(x,y)=0, for all x,y,z in P. In relation with congruence lattice…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…

Discrete Mathematics · Computer Science 2024-05-10 Susumu Kubo

In the paper, we first classify all polynomial maps of the form $H=(u(x,y,z),v(x,y,z), h(x,y))$ in the case that $JH$ is nilpotent and $\deg_zv\leq 1$. After that, we generalize the structure of $H$ to…

Algebraic Geometry · Mathematics 2020-06-15 Dan Yan

It is shown that for large classes of posets $P$ and $Q$, the defining ideal $J_{P,Q}$ of an isotonian algebras is generated by squarefree binomials. Within these classes, those posets are classified for which $J_{P,Q}$ is quadratically…

Commutative Algebra · Mathematics 2016-09-05 Jürgen Herzog , Ayesha Asloob Qureshi , Akihiro Shikama

For i = 1,2, let Gamma_i be a lattice in a simply connected, solvable Lie group G_i, and let X_i be a connected Lie subgroup of G_i. The double cosets Gamma_igX_i provide a foliation F_i of the homogeneous space Gamma_i\G_i. Let f be a…

Geometric Topology · Mathematics 2016-09-07 Holly Bernstein , Dave Witte

For any marked poset we define a continuous family of polytopes, parametrized by a hypercube, generalizing the notions of marked order and marked chain polytopes. By providing transfer maps, we show that the vertices of the hypercube…

Combinatorics · Mathematics 2017-12-05 Xin Fang , Ghislain Fourier , Jan-Philipp Litza , Christoph Pegel

We study bifurcations of area-preserving maps, both orientable (symplectic) and non-orientable, with quadratic homoclinic tangencies. We consider one and two parameter general unfoldings and establish results related to the appearance of…

Dynamical Systems · Mathematics 2015-09-02 Amadeu Delshams , Marina Gonchenko , Sergey Gonchenko

Birkhoff's representation theorem for finite distributive lattices states that any finite distributive lattice is isomorphic to the lattice of order ideals (lower sets) of the partial order of the join-irreducible elements of the lattice.…

Combinatorics · Mathematics 2023-03-15 Dale R. Worley

A filter lattice is a distributive lattice formed by all filters of a poset in the anti-inclusion order. We study the combinatorial properties of the Hasse diagrams of filter lattices of certain posets, so called Fibonacci-like cubes, in…

Combinatorics · Mathematics 2019-05-03 Xuxu Zhao , Xu Wang , Haiyuan Yao

We study quadratic, volume preserving diffeomorphisms whose inverse is also quadratic. Such maps generalize the H\'enon area preserving map and the family of symplectic quadratic maps studied by Moser. In particular, we investigate a family…

Dynamical Systems · Mathematics 2020-06-02 Hector E. Lomeli , James D. Meiss

One of the main objectives of topological data analysis is the study of discrete invariants for persistence modules, in particular when dealing with multiparameter persistence modules. In many cases, the invariants studied for these…

Algebraic Topology · Mathematics 2026-05-20 Claire Amiot , Thomas Brüstle , Eric J. Hanson

Let a be a positive integer which is not a perfect h-th power with h greater than 1, and Q_a(x;4,j) be the set of primes p less than x such that the residual order of a(mod p) is congruent to j modulo 4. When j=0, 2, it is known that…

Number Theory · Mathematics 2007-05-23 L. Murata , K. Chinen

Let F* be the finite field of q elements and let P(n,q) be the projective space of dimension n-1 over F*. We construct a family H^{n}_{k,i} of combinatorial homology modules associated to P(n,q) over a coefficient field F field of…

Combinatorics · Mathematics 2012-02-22 Johannes Siemons , Daniel Smith

We prove the conjecture that the higher Tamari orders of Dimakis and M\"uller-Hoissen coincide with the first higher Stasheff--Tamari orders. To this end, we show that the higher Tamari orders may be conceived as the image of an…

Combinatorics · Mathematics 2021-05-19 Nicholas J. Williams

In section 1 we consider a 3-tuple $S=(|S|,\preccurlyeq,E)$ where $|S|$ is a finite set, $\preccurlyeq$ a partial ordering on $|S|,$ and $E$ a set of unordered pairs of distinct members of $|S|,$ and study, as a function of $n\geq 0,$ the…

Combinatorics · Mathematics 2018-06-12 George M. Bergman

In previous work, we associated a module $T(i)$ to every segment $i$ of a link diagram $K$ and showed that there is a poset isomorphism between the submodules of $T(i)$ and the Kauffman states of $K$ relative to $i$. In this paper, we show…

Combinatorics · Mathematics 2024-09-18 Véronique Bazier-Matte , Ralf Schiffler

We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretation of the order given by this lattice, using (not…

Combinatorics · Mathematics 2007-05-23 Sebastien Desreux , Martin Matamala , Ivan Rapaport , Eric Remila

In the second edition of the congruence lattice book, Problem 22.1 asks for a characterization of subsets $Q$ of a finite distributive lattice $D$ such that there is a finite lattice $L$ whose congruence lattice is isomorphic to $D$ and…

Rings and Algebras · Mathematics 2017-06-22 G. Grätzer , H. Lakser

For a (finite) partially ordered set (poset) $P$, we call a dominating set $D$ in the comparability graph of $P$, an order-sensitive dominating set in $P$ if either $x\in D$ or else $a<x<b$ in $P$ for some $a,b\in D$ for every element $x$…

Combinatorics · Mathematics 2023-07-28 Yusuf Civan , Zakir Deniz , Mehmet Akif Yetim

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

Combinatorics · Mathematics 2025-04-15 Christoph Minz
‹ Prev 1 4 5 6 7 8 10 Next ›