相关论文: Antichain cutsets in real-ranked lattices

Hypergraph partitioning has a wide range of important applications such as VLSI design or scientific computing. With focus on solution quality, we develop the first multilevel memetic algorithm to tackle the problem. Key components of our…

A well-known classical result states that $c_0$ is linearly embeddable in a Banach lattice if and only if it is lattice embeddable. Improving results of H.P.~Lotz, H.P.~Rosenthal and N.~Ghoussoub, we prove that $C[0,1]$ shares this property…

We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial…

Partitioning a graph into blocks of roughly equal weight while cutting only few edges is a fundamental problem in computer science with numerous practical applications. While shared-memory parallel partitioners have recently matured to…

Given a tree of weighted vertices, it is sometimes possible to break the tree into two equally-weighted subtrees within an allowable error. We give a fast algorithm that finds an edge which breaks the tree into equal-weight components or…

We introduce and analyze a quantum spin/Majorana chain with a tricritical Ising point separating a critical phase from a gapped phase with order-disorder coexistence. We show that supersymmetry is not only an emergent property of the…

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small…

Let $L$ be a set of $n$ lines in the plane, not necessarily in general position. We present an efficient algorithm for finding all the vertices of the arrangement $A(L)$ of maximum level, where the level of a vertex $v$ is the number of…

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…

In classical set theory, the ordinals form a linear chain that we often think of as a very thin portion of the set-theoretic universe. In intuitionistic set theory, however, this is not the case and there can be incomparable ordinals. In…

We give two sufficient conditions for the lattice Co(R^n,X) of relatively convex sets of n-dimensional real space R^n to be join-semidistributive, where X is a finite union of segments. We also prove that every finite lower bounded lattice…

We determine the fixed locus of the anticanonical complete linear system of a given anticanonical rational surface. The case of a geometrically ruled rational surface is fully studied, e.g., the monoid of numerically effective divisor…

A preferential arrangement of a finite set is an ordered partition. Associated with each such ordered partition is a chain of subsets or blocks endowed with a linear order. The chain may be split into sections by the introduction of a…

In this paper, we continue the investigation of topological properties of unbounded norm (un-)topology in normed lattices. We characterize separability and second countability of un-topology in terms of properties of the underlying normed…

We study several natural classes of graphs on a zero-dimensional metrizable compact space having no continuous coloring. We compare these graphs with the quasi-order associated with injective continuous homomorphisms. We prove the existence…

We study the cutwidth measure on graphs and ways to bound the cutwidth of a graph by partitioning its vertices. We consider bounds expressed as a function of two quantities: on the one hand, the maximal cutwidth y of the subgraphs induced…

Since Henrik Strietz's 1975 paper proving that the lattice Part($n$) of all partitions of an $n$-element finite set is four-generated, more than half a dozen papers have been devoted to four-element generating sets of this lattice. We prove…

In a recent article, Iyama and Marczinzik showed that a lattice is distributive if and only if the incidence algebra is Auslander regular, giving a new connection between homological algebra and lattice theory. In this article we study when…

String breaking is a non-perturbative long-distance feature of QCD that is involved in for example meson decays. A mixing analysis of lattice operators at zero temperature gives the level splitting and mixing energy between the broken and…