Related papers: Fast M\"obius inversion in semimodular lattices an…
This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…
Let X be a finite set. This paper describes some topological and combinatorial properties of the poset \Omega_X of order relations on X. In particular, the homotopy type of all the intervals in \Omega_X is precisely determined, and the…
We consider two generalizations of Pollack's uncertainty principle for M\"obius inversion to locally finite posets. The first generalization was previously studied by Goh. Here, we provide a simplified sufficient criterion for the…
In an earlier paper, we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of $n$-by-$n$ matrices can be done by any algorithm in $O(n^{\omega +…
Let E be an operator algebra on a Hilbert space with finite-dimensional generated C*-algebra. A classification is given of the locally finite algebras and the operator algebras obtained as limits of direct sums of matrix algebras over E…
Let $\mathcal{M}=\{m_\lambda\}_{\lambda\in\Lambda}$ be a separating family of lattice seminorms on a vector lattice $X$, then $(X,\mathcal{M})$ is called a multi-normed vector lattice (or MNVL). We write $x_\alpha \xrightarrow{\mathrm{m}}…
We present a systematical method for obtaining analytical long-range embedded-atom potentials based on the lattice-inversion method. The potentials converge faster (exponentially) than Sutton and Chen's power-law potentials (Philos. Mag.…
We introduce the notion of orbitmesy, which is related to homomesy, a central phenomenon in dynamical algebraic combinatorics. An orbit $O$ is said to be orbitmesic with respect to a statistic if the orbit's average statistic value is equal…
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…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…
The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast…
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…
For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…
Due to the invariance properties of cross-ratio, M\"obius transformations are often used to map a set of points or other geometric object into a symmetric position to simplify a problem studied. However, when the points are mapped under a…
Dual pairs of interior and exterior Hardy spaces associated to a simple closed Lipschitz planar curve are considered, leading to a M\"obius invariant function bounding the norm of the Cauchy transform $\bf{C}$ from below. This function is…
A poset is called upper homogeneous, or "upho," if all of its principal order filters are isomorphic to the whole poset. In previous work of the first author, it was shown that each (finite-type N-graded) upho lattice has associated to it a…
This work concerns representations of a finite flat group scheme $G$, defined over a noetherian commutative ring $R$. The focus is on lattices, namely, finitely generated $G$-modules that are projective as $R$-modules, and on the full…
Let $\vec{G}=(V,E^+\cup E^-)$ be a bidirected graph whose underlying undirected graph $G=(V,E)$ is $2$-edge-connected. A strongly connected orientation (SCO) is defined as a subset of arcs that contains exactly one of $e^+,e^-$ for every…
We develop a cohomological approach to M\"obius inversion using derived functors in the enriched categorical setting. For a poset $P$ and a closed symmetric monoidal abelian category $\mathcal{C}$, we define M\"obius cohomology as the…
An alternative to the matrix inverse procedure is presented. Given a bit register which is arbitrarily large, the matrix inverse to an arbitrarily large matrix can be peformed in ${\cal O}(N^2)$ operations, and to matrix multiplication on a…