Related papers: Fast M\"obius inversion in semimodular lattices an…
In this paper we describe a new algorithm called Fast Adaptive Sequencing Technique (FAST) for maximizing a monotone submodular function under a cardinality constraint $k$ whose approximation ratio is arbitrarily close to $1-1/e$, is…
We find two combinatorial identities on the theta series of the root lattices of the finite-dimensional simple Lie algebras of type $D_{4n}$ and the cosets in their integral duals, in terms of the well-known Essenstein series $E_4(z)$ and…
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…
We study quasi-isometric embeddings of symmetric spaces and non-uniform irreducible lattices in semisimple higher rank Lie groups. We show that any quasi-isometric embedding between symmetric spaces of the same rank can be decomposed into a…
The space of parametric b-measures endowed with appropriate topologies is introduced to define a new class of generalized ODEs given by parametric b-measures. This framework offers a new approach for dealing with precompact families of…
A partial lattice P is ideal-projective, with respect to a class C of lattices, if for every K $\in$ C and every homomorphism $\phi$ of partial lattices from P to the ideal lattice of K, there are arbitrarily large choice functions f : P…
We compute the local pro-isomorphic zeta functions at all but finitely many primes for a certain family of class-two-nilpotent Lie lattices of even rank, parametrized by irreducible non-linear polynomials $f(x) \in \mathbb{Z} [x]$, that…
Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset…
We prove certain conjecture holds true for a finite category which has M\"obius inversion. The conjecture states a relationship between the zeta function of a finite category and the Euler characteristic of a finite category.
We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its M\"obius function. We show that the weak order on Coxeter groups of type A, B, affine A, and the flag weak order…
The M{\"o}bius transform is a crucial transformation into the Boolean world; it allows to change the Boolean representation between the True Table and Algebraic Normal Form. In this work, we introduce a new algebraic point of view of this…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
We introduce a novel combinatorial structure called pointed building sets, which can be viewed as families of lattices equipped with compatibility relations. To each pointed building set $\mathsf{B}$, we associate a complete lattice…
This work proves that the process of gluing finite lattices to form a larger lattice is bijective, that is each lattice is the glued sum of a unique system of finite lattices, provided the class of lattices is constrained to modular,…
Bipartitional relations were introduced by Foata and Zeilberger in their characterization of relations which give rise to equidistribution of the associated inversion statistic and major index. We consider the natural partial order on…
We show how to compute efficiently with nominal sets over the total order symmetry, by developing a direct representation of such nominal sets and basic constructions thereon. In contrast to previous approaches, we work directly at the…
We propose a method for the fast generation of a quantum register of addressable qubits consisting of ultracold atoms stored in an optical lattice. Starting with a half filled lattice we remove every second lattice barrier by adiabatically…
Let $A$ be the generator of a strongly continuous cosine family $(\cos (tA))_{t\in {\bf R}}$ on a complex Banach space $E$. The paper develops an operational calculus for integral transforms and functions of $A$ using the generalized…
A lattice reduction is an algorithm that transforms the given basis of the lattice to another lattice basis such that problems like finding a shortest vector and closest vector become easier to solve. We define a class of bases called…
A careful study is made of embeddings of posets which have a convex range. We observe that such embeddings share nice properties with the homomorphisms of more restrictive categories; for example, we show that every order embedding between…