Related papers: Fast M\"obius inversion in semimodular lattices an…
Using shift vector method we obtain a large class of self-dual lattices of dimension $(l,l)$, which has a one to one correspondence with modular invariants of free bosonic theory compactified on co-root lattice of a rank $l$ Lie group. Then…
We elaborate on the notion of a filtration of an operad defined in terms of a lattice-valued operad serving as an indexing object. That covers ordinary integer-indexed filtrations of associative algebras and operads as a special case, yet…
It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…
We extend a result regarding the Random Backward Iteration algorithm for drawing Julia sets (known to work for certain rational semigroups containing a non-M\"obius element) to a class of M\"obius semigroups which includes certain settings…
This paper concerns the lattice $L_n$ of subsets of $\{1,\ldots,n\}$ that are arithmetic progressions, under the inclusion order. For $n\geq 4$, this poset is not graded and thus not semimodular. We give three independent proofs of the fact…
We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…
Representing lattices L by equivalence relations amounts to embed them into the lattice Part(V) of all partitions of a set V, and has a long history. Here we are concerned with MODULAR lattices L and aim for sets V as small as possible,…
We determine the M\"obius function of the poset of compositions of an integer. In fact we give two proofs of this formula, one using an involution and one involving discrete Morse theory. The composition poset turns out to be intimately…
We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretation of the order given by this lattice, using (not…
An instance of the super-stable matching problem with incomplete lists and ties is an undirected bipartite graph $G = (A \cup B, E)$, with an adjacency list being a linearly ordered list of ties. Ties are subsets of vertices equally good…
We revisit the mergeable dictionaries with shift problem, where the goal is to maintain a family of sets subject to search, split, merge, make-set, and shift operations. The search, split, and make-set operations are the usual well-known…
A generalized summation by parts algorithm is presented for solving of difference equations of the form $T^m(y)-a[u]y=b[u]$ where $T$ denotes the shift $u_j\to u_{j+1}$. Solvability of such type of equations with respect to coefficients of…
For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…
We propose a novel framework for fast integral operations by uncovering hidden geometries in the row and column structures of the underlying operators. This is accomplished through the \texttt{Questionnaire} algorithm, an iterative…
The article deals with the family ${\mathcal U}(\lambda)$ of all functions $f$ normalized and analytic in the unit disk such that $\big |\big (z/f(z)\big )^{2}f'(z)-1\big |<\lambda $ for some $0<\lambda \leq 1$. The family ${\mathcal…
A new algorithm for computing Hecke operators for SL(n,Z) was introduced by MacPherson, McConnell in 2020. The algorithm uses tempered perfect lattices, which are certain pairs of lattices together with a quadratic form. These generalize…
We classify the unimodular Euclidean integral lattices of rank 29 by developing an elementary, yet very efficient, inductive method. As an application, we determine the isometry classes of even lattices of rank at most 28 and prime…
In this paper we provide a preliminary investigation of subclasses of bounded posets with antitone involution which are "pastings" of their maximal Kleene sub-lattices. Specifically, we introduce super-paraorthomodular lattices, namely…
Graph-based learning is a cornerstone for analyzing structured data, with node classification as a central task. However, in many real-world graphs, nodes lack informative feature vectors, leaving only neighborhood connectivity and class…
A lattice is a partially-ordered set in which every pair of elements has a unique meet (greatest lower bound) and join (least upper bound). We present new data structures for lattices that are simple, efficient, and nearly optimal in terms…