Results 91 to 100 of about 523 (235)
A characterization of a pomonoid $S$ all of its cyclic $S$-posets are regular injective [PDF]
Categories and General Algebraic Structures with Applications, 2013 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
Discrete Mathematics, 2000 As there is a theory of random graphs, there is a theory of random posets based on a variety of models trickier to produce because of transitivity. One of these is the Brightwell-model \(O(W_1, \dots, W_n)=O (S_1, \dots,S_n)\), \(|W_i|=S_i\), where \(\{W_1,\dots,W_n\}\) partitions the set \(W\) on which the random posets \(P\) are defined.
openaire +2 more sources
Algorithmica, 2012 We describe an algorithm for compressing a partially ordered set, or \emph{poset}, so that it occupies space matching the information theory lower bound (to within lower order terms), in the worst case. Using this algorithm, we design a succinct data structure for representing a poset that, given two elements, can report whether one precedes the other ...
J. Ian Munro, Patrick K. Nicholson
openaire +4 more sources
Plane posets, special posets, and permutations
Advances in Mathematics, 2013 We study the self-dual Hopf algebra $\h\_{\SP}$ of special posets introduced by Malvenuto and Reutenauer and the Hopf algebra morphism from $\h\_{\SP}$ to to the Hopf algebra of free quasi-symmetric functions $\FQSym$ given by linear extensions. In particular, we construct two Hopf subalgebras both isomorphic to $\FQSym$; the first one is based on ...
openaire +4 more sources
The Poset of Proper Divisibility [PDF]
SIAM Journal on Discrete Mathematics, 2017 We study the partially ordered set $P(a_1,\ldots, a_n)$ of all multidegrees $(b_1,\dots,b_n)$ of monomials $x_1^{b_1}\cdots x_n^{b_n}$ which properly divide $x_1^{a_1}\cdots x_n^{a_n}$. We prove that the order complex $ (P(a_1,\dots,a_n))$ of $P(a_1,\ldots a_n)$ is (non-pure) shellable, by showing that the order dual of $P(a_1,\ldots,a_n)$ is $\mathrm{
Bolognini, Davide +4 more
openaire +4 more sources
Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT Given access to the vertex set V$$ V $$ of a connected graph G=(V,E)$$ G=\left(V,E\right) $$ and an oracle that given two vertices u,v∈V$$ u,v\in V $$, returns the shortest path distance between u$$ u $$ and v$$ v $$, how many queries are needed to reconstruct E$$ E $$?
Paul Bastide, Carla Groenland
wiley +1 more source
The birational geometry of GIT quotients
Bulletin of the London Mathematical Society, Volume 57, Issue 7, Page 1952-1967, July 2025.Abstract Geometric invariant theory (GIT) produces quotients of algebraic varieties by reductive groups. If the variety is projective, this quotient depends on a choice of polarisation; by work of Dolgachev–Hu and Thaddeus, it is known that two quotients of the same variety using different polarisations are related by birational transformations.
Ruadhaí Dervan, Rémi Reboulet
wiley +1 more source
Coloured shuffle compatibility, Hadamard products, and ask zeta functions
Bulletin of the London Mathematical Society, Volume 57, Issue 7, Page 2132-2154, July 2025.Abstract We devise an explicit method for computing combinatorial formulae for Hadamard products of certain rational generating functions. The latter arise naturally when studying so‐called ask zeta functions of direct sums of modules of matrices or class‐ and orbit‐counting zeta functions of direct products of nilpotent groups.
Angela Carnevale +2 more
wiley +1 more source
A Comment on: “Monotone Comparative Statics”
Econometrica, Volume 93, Issue 4, Page 1481-1490, July 2025.Milgrom and Shannon (1994) provide necessary and sufficient conditions on parameterized optimization problems for their solution sets to be globally monotone in the parameter. We establish that their conditions may be significantly relaxed when focusing on discrete, binary comparisons between solution sets.
Rabah Amir, David Rietzke
wiley +1 more source
, 2006 We define families of posets, ordered by prefixes, as the counterpart of the usual families of configurations ordered by subsets. On these objects we define two types of morphism, event and order morphisms, resulting in categories FPos and FPosv. We then show the following: - Families of posets, in contrast to families of configurations, are always ...
openaire +4 more sources