相关论文: Mobius functions of lattices

For each lattice one can define a free boson theory propagating on the corresponding torus. We give an alternative definition where one employs any automorphism of the group $M^*/M$. This gives a wealth of conformal data, which we realize…

We prove general superrigidity results for actions of irreducible lattices on CAT(0) spaces; first, in terms of the ideal boundary, and then for the intrinsic geometry (including for infinite-dimensional spaces). In particular, one obtains…

A barcode is a finite multiset of intervals on the real line. Jaramillo-Rodriguez (2023) previously defined a map from the space of barcodes with a fixed number of bars to a set of multipermutations, which presented new combinatorial…

We study the multiplication operation of square matrices over lattices. If the underlying lattice is distributive, then matrices form a semigroup; we investigate idempotent and nilpotent elements and the maximal subgroups of this matrix…

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

We establish nontrivial bounds for bilinear sums involving the M\"obius function evaluated over solutions to a broad class of equations. Several of our results may be regarded as M\"obius-function analogues of the ternary Goldbach problem.…

We define and study "semimatroids", a class of objects which abstracts the dependence properties of an affine hyperplane arrangement. We show that geometric semilattices are precisely the posets of flats of semimatroids. We define and…

This paper is a brief mathematical excursion which starts from quantum electrodynamics and leads to the Moebius function of the Tamari lattice of planar binary trees, within the framework of groups of tree-expanded series. First we recall…

We show that the subgroup lattice of any finite group satisfies Frankl's Union-Closed Conjecture. We show the same for all lattices with a modular coatom, a family which includes all supersolvable and dually semimodular lattices. A common…

This paper studies Frobenius subalgebra posets in abelian monoidal categories and shows that, under general conditions--satisfied in all semisimple tensor categories over the complex field--they collapse to lattices through a rigidity…

We prove that for any two lattices $L, M \subseteq \mathbb{R}^d$ of the same volume there exists a measurable, bounded, common fundamental domain of them. In other words, there exists a bounded measurable set $E \subseteq \mathbb{R}^d$ such…

Given a unimodular lattice $\Lambda\subseteq \mathbb{R}^2$ consider the counting function $\mathcal{N}_\Lambda(T)$ counting the number of lattice points of norm less than $T$, and the remainder $\mathcal{R}_\Lambda(T)=\mathcal{N}(T)-\pi…

We prove that functions defined on a lattice in a finite dimensional torus with bounded finite differences can be smoothly extended to the whole torus, and relate the bounds on the extension's derivatives with bounds on the original…

We give extensions of results on nonnegative matrix semigroups which deduce finiteness or boundedness of such semigroups from the corresponding local properties, e.g., from finiteness or boundedness of values of certain linear functionals…

We exhibit algorithms for calculating Tits' buildings and orbits of vectors in a lattice $L$ for certain subgroups of $\operatorname{O}(L)$. We discuss how these algorithms can be applied to understand the configuration of boundary…

For two subsets S and T of a given lattice L, we define a relative distributive (modular) property over L, that underlies a large family including the usual class of distributive (modular) lattices. Our proposed class will be called…

In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking…

We show that there is a largely unexplored class of functions (positive polymatroids) that can define proper discrete metrics over pairs of binary vectors and that are fairly tractable to optimize over. By exploiting submodularity, we are…

Submodular set functions are undoubtedly among the most important building blocks of combinatorial optimization. Somewhat surprisingly, continuous counterparts of such functions have also appeared in an analytic line of research where they…

In this paper, we introduce the super telescoping formula, a natural generalization of well-known telescoping formula. We explore various aspects of the formula including its origin and the telescoping cancellations emerging from symmetric…