English
Related papers

Related papers: On the M\"obius Function and Topology of General P…

200 papers

We investigate the poset of strata of a Schubert-like stratification of certain natural compactification of the space of hermitian $n\times n$ matrices. We prove that this poset is a modular ortholattice, we compute its M\"{o}bius function…

Combinatorics · Mathematics 2007-11-06 Liviu I. Nicolaescu

We give conditions for a locally finite poset $P$ to have the property that for any functions $f:P\to {\bf C}$ and $g:P\to {\bf C}$ not identically zero and linked by the M\"obius inversion formula, the support of at least one of $f$ and…

Combinatorics · Mathematics 2026-03-03 Marcel K. Goh

We describe the structure of the monoid of natural-valued monotone functions on an arbitrary poset. For this monoid we provide a presentation, a characterization of prime elements, and a description of its convex hull. We also study the…

Combinatorics · Mathematics 2021-02-16 Winfried Bruns , Pedro A. García-Sánchez , Luca Moci

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

Combinatorics · Mathematics 2025-07-30 Kevin Ivan Piterman , Volkmar Welker

This is the author's PhD thesis. It is a contribution to categorical logic, in particular to the theory of realizability toposes. While the tools of categorical logic have proven very successful in analyzing and organizing proof theoretic…

Category Theory · Mathematics 2014-03-17 Jonas Frey

Considering a linearly ordered set, we introduce its symmetric version, and endow it with two operations extending supremum and infimum, so as to obtain an algebraic structure close to a commutative ring. We show that imposing symmetry…

Discrete Mathematics · Computer Science 2007-11-16 Michel Grabisch

The set of all permutations, ordered by pattern containment, is a poset. We give a formula for the M\"obius function of intervals $[1,\pi]$ in this poset, for any permutation $\pi$ with at most one descent. We compute the M\"obius function…

Combinatorics · Mathematics 2014-04-03 Jason P Smith

The class of O-metric spaces generalize several existing metric-types in literature including metric spaces, b-metric spaces, and ultra metric spaces. In this paper, we discuss the properties of the topology induced by an O-metric and…

General Mathematics · Mathematics 2025-04-29 Hallowed O. Olaoluwa , Aminat O. Ige , Johnson O. Olaleru

Posets are discrete mathematical structures which are ubiquitous in a broad range of data analysis and machine learning applications. Research connecting posets to the data science domain has been ongoing for many years. In this paper, a…

Machine Learning · Computer Science 2024-05-28 Arnauld Mesinga Mwafise

In [1] we introduced the notion of 'structured space', i.e. a space which locally resembles various algebraic structures. In [2] and [3] we studied some cohomology theories related to these space. In this paper we continue in this…

Algebraic Topology · Mathematics 2020-05-15 Manuel Norman

Let $S$ be a numerical semigroup and let $\left(\mathbb{Z},\leqslant\_S\right)$ be the (locally finite) poset induced by $S$ on the set of integers $\mathbb{Z}$ defined by $x \leqslant\_S y$ if and only if $y-x\in S$ for all integers $x$…

Combinatorics · Mathematics 2016-04-01 Jonathan Chappelon , Jorge Ramírez Alfonsín

Many innovative applications require establishing correspondences among 3D geometric objects. However, the countless possible deformations of smooth surfaces make shape matching a challenging task. Finding an embedding to represent the…

Computer Vision and Pattern Recognition · Computer Science 2022-06-09 Riccardo Marin , Souhaib Attaiki , Simone Melzi , Emanuele Rodolà , Maks Ovsjanikov

The M\"obius polynomial is an invariant of ranked posets, closely related to the M\"obius function. In this paper, we study the M\"obius polynomial of face posets of convex polytopes. We present formulas for computing the M\"obius…

Combinatorics · Mathematics 2016-08-18 Meena Jagadeesan , Susan Durst

We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain…

Combinatorics · Mathematics 2007-05-23 Andreas Blass , Bruce E. Sagan

This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…

Combinatorics · Mathematics 2016-03-29 Rade T. Živaljević

We define the notion of connectivity set for elements of any finitely generated Coxeter group. Then we define an order related to this new statistic and show that the poset is graded and each interval is a shellable lattice. This implies…

Combinatorics · Mathematics 2010-03-31 Nantel Bergeron , Christophe Hohlweg , Mike Zabrocki

We consider the problem of fast zeta and M\"obius transforms in finite posets, particularly in lattices. It has previously been shown that for a certain family of lattices, zeta and M\"obius transforms can be computed in $O(e)$ elementary…

Combinatorics · Mathematics 2016-08-22 Petteri Kaski , Jukka Kohonen , Thomas Westerbäck

As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…

Algebraic Topology · Mathematics 2020-04-22 Christin Bibby , Nir Gadish

We introduce the notion of coupled embeddability, defined for maps on products of topological spaces. We use known results for nonsingular biskew and bilinear maps to generate simple examples and nonexamples of coupled embeddings. We study…

Geometric Topology · Mathematics 2021-07-22 Florian Frick , Michael Harrison

We define a family of combinatorial objects, which we call Baxter posets. We prove that Baxter posets are counted by the Baxter numbers by showing that they are the adjacency posets of diagonal rectangulations. Given a diagonal…

Combinatorics · Mathematics 2016-10-14 Emily Meehan