English
Related papers

Related papers: Fast M\"obius inversion in semimodular lattices an…

200 papers

We study the linear differential system associated with the supersymmetric affine Toda field equations for affine Lie superalgebras, which has a purely odd simple root system. For an affine Lie algebra, the linear problem modified by…

High Energy Physics - Theory · Physics 2022-11-07 Katsushi Ito , Mingshuo Zhu

We formalize a transfinite Phi process that treats all possibility embeddings as operators on structured state spaces including complete lattices, Banach and Hilbert spaces, and orthomodular lattices. We prove a determinization lemma…

Functional Analysis · Mathematics 2025-08-15 Bugra Kilictas , Faruk Alpay

We give a Las Vegas algorithm which computes the shifted Popov form of an $m \times m$ nonsingular polynomial matrix of degree $d$ in expected $\widetilde{\mathcal{O}}(m^\omega d)$ field operations, where $\omega$ is the exponent of matrix…

Symbolic Computation · Computer Science 2016-05-13 Vincent Neiger

A poset is called upper homogeneous, or "upho," if every principal order filter of the poset is isomorphic to the whole poset. We study (finite type $\mathbb{N}$-graded) upho lattices, with an eye towards their classification. Any upho…

Combinatorics · Mathematics 2025-02-07 Sam Hopkins

As algebraic semantics of the logic of quantum mechanics there are usually used orthomodular posets, i.e. bounded posets with a complementation which is an antitone involution and where the join of orthogonal elements exists and the…

Rings and Algebras · Mathematics 2019-11-14 Ivan Chajda , Miroslav Kolařík , Helmut Länger

A sectionally pseudocomplemented poset P is one which has the top element and in which every principal order filter is a pseudocomplemented poset. The sectional pseudocomplements give rise to an implication-like operation on P which…

Logic · Mathematics 2013-01-07 J\{=}anis C\=ırulis

Given a graph $G$, a vertex switch of $v \in V(G)$ results in a new graph where neighbors of $v$ become nonneighbors and vice versa. This operation gives rise to an equivalence relation over the set of labeled digraphs on $n$ vertices. The…

Data Structures and Algorithms · Computer Science 2014-08-22 Nathan Lindzey

A main goal in lattice theory is the construction of dense lattices. Most of the remarkable dense lattices in small dimensions have an additional symmetry, they are modular, i.e. similar to their dual lattice. Extremal lattices are densest…

Number Theory · Mathematics 2007-05-23 Gabriele Nebe

Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…

Number Theory · Mathematics 2022-09-01 Werner Bley , Tommy Hofmann , Henri Johnston

We prove that $n$-bit integers may be multiplied in $O(n \log n \, 4^{\log^* n})$ bit operations. This complexity bound had been achieved previously by several authors, assuming various unproved number-theoretic hypotheses. Our proof is…

Symbolic Computation · Computer Science 2019-02-13 David Harvey , Joris van der Hoeven

Using the operators of taking upper and lower cones in a poset with a unary operation, we define operators M(x,y) and R(x,y) in the sense of multiplication and residuation, respectively, and we show that by using these operators, a general…

Logic · Mathematics 2018-09-27 Ivan Chajda , Helmut Länger

Let $X$ be a vector lattice and $(E,\tau)$ be a locally solid vector lattice. An operator $T:X\to E$ is said to be $ob$-bounded if, for each order bounded set $B$ in $X$, $T(B)$ is topologically bounded in $E$. In this paper, we study on…

Functional Analysis · Mathematics 2018-02-12 Abdullah Aydın

Fast linear transforms are ubiquitous in machine learning, including the discrete Fourier transform, discrete cosine transform, and other structured transformations such as convolutions. All of these transforms can be represented by dense…

Machine Learning · Computer Science 2021-01-01 Tri Dao , Albert Gu , Matthew Eichhorn , Atri Rudra , Christopher Ré

We shed some light on the problem of determining the orbits of the braid group action on semiorthonormal bases of Mukai lattices as considered in \cite{GK04} and \cite{GO1}. We show that there is an algebraic (and in particular algorithmic)…

Algebraic Geometry · Mathematics 2007-05-23 Amiel Ferman

We introduce residuated ortholattices as a generalization of -- and environment for the investigation of -- orthomodular lattices. We establish a number of basic algebraic facts regarding these structures, characterize orthomodular lattices…

Logic · Mathematics 2021-09-14 Wesley Fussner , Gavin St. John

Building upon the results of Jacobs, we show that the category OMLatLin of orthomodular lattices and linear maps forms a dagger category. For each orthomodular lattice X, we construct a Foulis m-semilattice Lin(X) composed of endomorphisms…

Logic · Mathematics 2025-04-01 Michal Botur , Jan Paseka , Milan Lekár

Latent position models (LPMs) are a large and popular class of models for random graphs. However, fitting Bayesian LPMs is computationally challenging - computing the likelihood even once takes time that is quadratic in the number of…

Computation · Statistics 2026-05-29 Zonghao Li , Aaron Smith

Certain vertex operator algebras have integral forms (integral spans of bases which are closed under the countable set of products). It is unclear when they (or integral multiples of them) are integral as lattices under the natural bilinear…

Group Theory · Mathematics 2014-05-20 Chongying Dong , Robert L. Griess

We call a poset factorable if its characteristic polynomial has all positive integer roots. Inspired by inductive and divisional freeness of a central hyperplane arrangement, we introduce and study the notion of inductive posets and their…

Combinatorics · Mathematics 2024-01-09 Roberto Pagaria , Maddalena Pismataro , Tan Nhat Tran , Lorenzo Vecchi

Identifying when different images are of the same object despite changes caused by imaging technologies, or processes such as growth, has many applications in fields such as computer vision and biological image analysis. One approach to…

Computer Vision and Pattern Recognition · Computer Science 2016-08-12 Stephen Marsland , Robert McLachlan