Results 81 to 90 of about 48,121,096 (211)
Poset games are two-player impartial combinatorial games, with normal play convention. Starting with any poset, the players take turns picking an element of the poset, and removing that and all larger elements from the poset.
Steven Byrnes, Byrnes, Steven
core +1 more source
The representations of posets (partially ordered sets), introduced by L. A. Nazarova and A. V. Roiter in 1972, play an important role in the modern representation theory and its applications. M. M.
В. М. Бондаренко +1 more
doaj +1 more source
A Linear Generalization of the Nearly Gorenstein Property, With Applications to Veronese Subalgebras
ABSTRACT We study the nearly Gorenstein property for Veronese subalgebras of (semi‐)standard graded algebras. We introduce a condition (♮)$(\natural)$ for Cohen–Macaulay semi‐standard graded rings, motivated by the study of Ehrhart rings. We show that if a semi‐standard graded algebra R$ R$ satisfies (♮)$(\natural)$, then its Veronese subalgebras R(k)$
Sora Miyashita
wiley +1 more source
MDS poset-codes satisfying the asymptotic Gilbert-Varshamov bound in hamming weights
We prove that MDS linear poset-codes satisfy Gilbert-Varshamov bound for their Hamming weights asymptotically. We also construct MDS linear poset-codes on arbitrary poset-metric spaces by using the Dilworth's chain decomposition theorem and ...
이윤진, 현종윤
core +1 more source
A characterization of a pomonoid $S$ all of its cyclic $S$-posets are regular injective [PDF]
This work is devoted to give a charcaterization of a pomonoid $S$ such that all cyclic $S$-posets are regular injective.
Xia Zhang, Wenling Zhang, Ulrich Knauer
doaj
Geometric inverse semigroup theory: a note on the Milnor–Schwarz lemma for inverse monoids
Abstract We generalise the Milnor–Schwarz lemma to inverse monoids acting on presheaves of geodesic metric spaces. We provide two proofs of this fact: one only uses elementary techniques, inspired by the arguments for group actions on metric spaces; the other involves a version of the Vietoris–Rips complex, and builds on work of Chung–Martínez–Szakács.
Giorgio Mangioni, Francesco Tesolin
wiley +1 more source
Cauchy identities for staircase matrices
Abstract The well‐known Cauchy identity expresses the product of terms (1−xiyj)−1${(1-{x}_{i}{y}_{j})}^{-1}$ for (i,j)$(i,j)$ indexing entries of a rectangular m×n$m\ensuremath{\times{}}n$‐matrix as a sum over partitions λ$\lambda $ of products of Schur polynomials: sλ(x)sλ(y)${s}_{\lambda}(x){s}_{\lambda}(y)$.
Evgeny Feigin +2 more
wiley +1 more source
Computing metric hulls in graphs [PDF]
We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This implies that there is a polynomial time algorithm to compute the convex hull number of a graph, when all
Kolja Knauer, Nicolas Nisse
doaj +1 more source
Modeling Poset Convex Subsets [PDF]
A subset S of a poset (partially ordered set) is convex if and only if S contains every poset element which is between any two elements in S. Poset convex subsets arise in applications that involve precedence constraints, such as in project scheduling ...
Wolsey, Laurence, Queyranne, Maurice
core
Cartwright–Sturmfels Hilbert schemes
Abstract Let S$S$ be the Cox ring of a product of r$r$ projective spaces. In this paper, we study the Cartwright–Sturmfels Hilbert schemes of S$S$, which are multigraded Hilbert schemes that parameterize only radical ideals. Our main result shows that these Hilbert schemes are always smooth and irreducible if the Picard rank r$r$ is at most 2.
Ritvik Ramkumar, Alessio Sammartano
wiley +1 more source

