Related papers: Classification of lattice triangles by their two s…
The lattice diameter of a bounded set $S \subset \mathbb{R}^d$ measures the maximal number of lattice points in a segment whose endpoints are lattice points in $S$. Such a segment is called a lattice diameter segment of $S$. This simple…
We consider the well-known Rosenbloom-Tsfasman function field lattices in the special case of Hermitian function fields. We show that in this case the resulting lattices are generated by their minimal vectors, provide an estimate on the…
We introduce an alternative stratification of knots: by the size of lattice on which a knot can be first met. Using this classification, we find ratio of unknots and knots with more than 10 minimal crossings inside different lattices and…
We introduce the notion of ideal triangle in the Bruhat-Tits building associated to a split group -- it is analogous to the usual notion of triangle, but one vertex is "at infinity" in a certain direction. We prove that the algebraic…
Let S be a site. First we define the 3-category of torsors under a Picard S-2-stack and we compute its homotopy groups. Using calculus of fractions we define also a pure algebraic analogue of the 3-category of torsors under a Picard…
In this paper we consider arbitrary hexagons on the triangular lattice with three arbitrary bowtie-shaped holes, whose centers form an equilateral triangle. The number of lozenge tilings of such general regions is not expected --- and…
We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…
We utilize the Bruns-Lakser completion to introduce Bruns-Lakser towers of a meet-semilattice. This machinery enables us to develop various hierarchies inside the class of bounded distributive lattices, which measure $\kappa$-degrees of…
We classify lattice $3$-polytopes of width larger than one and with exactly $6$ lattice points. We show that there are $74$ polytopes of width $2$, two polytopes of width $3$, and none of larger width. We give explicit coordinates for…
It has been common wisdom among mathematicians that Extended Topological Field Theory in dimensions higher than two is naturally formulated in terms of n-categories with n> 1. Recently the physical meaning of these higher categorical…
We give a classification of the lattices of rank r=4, r=8 and r=12 over \Q(\sqrt{-3}), which are even and unimodular \Z-lattices. Using this classification we construct the associated theta series, which are Hermitian modular forms, and…
A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…
Toric geometry provides a bridge between the theory of polytopes and algebraic geometry: one can associate to each lattice polytope a polarized toric variety. In this thesis we explore this correspondence to classify smooth lattice…
This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete…
This paper deals with lattices $(L,\Vert~\Vert)$ over polynomial rings, where $L$ is a finitely generated module over $k[t]$, the polynomial ring over the field $k$ in the indeterminate $t$, and $\Vert~\Vert$ is a discrete real-valued…
Working over a field of characteristic zero, we give structure theorems for all grade three licci ideals and their minimal free resolutions. In particular, we completely classify such ideals up to deformation. The descriptions of their…
Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…
Predicting protein secondary structure using lattice model is one of the most studied computational problem in bioinformatics. Here secondary structure or three dimensional structure of protein is predicted from its amino acid sequence.…