Results 61 to 70 of about 21,091,768 (168)

The Spider Poset Is Macaulay [PDF]

open access: yes, 2000
Let Q(k, l) be a poset whose Hasse diagram is a regular spider with k+1 legs having the same length l. We show that for any n⩾1 the nth cartesian power of the spider poset Q(k, l) is a Macaulay poset for any k⩾0 and l⩾1.
Bezrukov, Sergei L., Elsässer, Robert
core   +1 more source

Interpolation categories for conformal embeddings

open access: yesProceedings of the London Mathematical Society, Volume 133, Issue 3, September 2026.
Abstract In this paper, we give a diagrammatic description of the categories of modules coming from the conformal embeddings V(slN,N)⊂V(soN2−1,1)$\mathcal{V}({\mathfrak{sl}}_{N},N)\subset \mathcal{V}({\mathfrak{so}}_{{N}^{2}-1},1)$. A small variant of this construction (morally corresponding to a conformal embedding of glN${\mathfrak{gl}}_{N}$ level N ...
Cain Edie‐Michell, Noah Snyder
wiley   +1 more source

Localization sequences for logarithmic topological cyclic homology

open access: yesJournal of Topology, Volume 19, Issue 3, September 2026.
Abstract We introduce the notion of an Ek$\mathbb {E}_k$‐ring with prelogarithmic structure, define logarithmic topological Hochschild homology and logarithmic topological cyclic homology in this context, and establish localization sequences for these theories. Our approach is based on Thom R$R$‐algebras.
John Rognes   +2 more
wiley   +1 more source

Boxicity and poset dimension

open access: yes, 2010
Let G be a simple, undirected, finite graph with vertex set V(G) and edge set E(C). A k-dimensional box is a Cartesian product of closed intervals a(1), b(1)] x a(2), b(2)] x ... x a(k), b(k)]. The boxicity of G, box(G) is the minimum integer k such that
Chandran, Sunil L   +5 more
core   +1 more source

Error-block codes and poset metrics [PDF]

open access: yes, 2015
Let P = ({1, 2,..., n},
Firer, Marcelo   +2 more
core   +1 more source

On Poset Sandwich Problems [PDF]

open access: yes, 2003
International audienceA graph $G_s=(V,E_s)$ is a sandwich for a pair of graph $G_t=(V,E_t)$ and $G=(V,E)$ if $E_t\subseteq E_s\subseteq E$. Any poset, or partially ordered set, admits a unique graph representation which is directed and transitive.
Habib, Michel   +3 more
core   +4 more sources

How to see the forest despite the trees

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 2, August 2026.
Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley   +1 more source

Germs in a poset

open access: yes, 2020
Motivated by the theory of correspondence functors, we introduce the notion of germ in a finite poset, and the notion of germ extension of a poset. We show that any finite poset admits a largest germ extension called its germ closure.
Bouc, Serge
core   +1 more source

On categorical aspects of S -quantales

open access: yesOpen Mathematics, 2018
S-quantales are characterized as injective objects in the category of S-posets with respect to certain class of homomorphisms that are order-preserving mappings. This paper is devoted to exhibitions of categorical structures on S-quantales.
Zhang Xia, Zhou Yunyan
doaj   +1 more source

The asymptotic Mahler measure of Gaussian periods

open access: yesProceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.
Abstract We construct a sequence of cyclotomic integers (Gaussian periods) of particularly small Mahler measure/height. We study the asymptotics of their Mahler measure as a function of their conductor, to find that the growth rate is the (multivariate) Mahler measure of a family of log Calabi–Yau varieties of increasing dimension.
Gunther Cornelissen   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy