Related papers: Unimodular Hunting

There are well known algorithms to compute the class group of the maximal order $\mathcal{O}_K$ of a number field $K$ and the group of invertible ideal classes of a non-maximal order $R$. In this paper we explain how to compute also the…

Bauer and Itzykson showed that associated to each labeled map embedded on an oriented Riemann surface there was a group generated by a pair of permutations. From this result an algorithm may be constructed for enumerating labeled maps, and…

We consider the automorphism groups of various Lorentzian lattices over the Eisenstein, Gaussian, and Hurwitz integers, and in some of them we find reflection groups of finite index. These provide new finite-covolume reflection groups…

This work introduces two new notions of dimension, namely the unimodular Minkowski and Hausdorff dimensions, which are inspired from the classical analogous notions. These dimensions are defined for unimodular discrete spaces, introduced in…

Let $R$ be an affine algebra over an algebraically closed field of characteristic $0$ with dim$(R)=n$. Let $P$ be a projective $A=R[T_1,\cdots,T_k]$-module of rank $n$ with determinant $L$. Suppose $I$ is an ideal of $A$ of height $n$ such…

We present two methods to continuously and piecewise-linearly parametrize rank-3 lattices by vectors of $\RR^{13}$, which provides an efficient way to judge if two sets of parameters provide nearly identical lattices within their margins of…

We consider all compatible topologies of an arbitrary finite-dimensional vector space over a non-trivial valuation field whose metric completion is a locally compact space. We construct the canonical lattice isomorphism between the lattice…

We present a procedure which allows one to integrate explicitly the class of checkerboard IC-nets which has recently been introduced as a generalisation of incircular (IC) nets. The latter class of privileged congruences of lines in the…

Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…

An analytical method for getting new complex Hadamard matrices by using mutually unbiased bases and a nonlinear doubling formula is provided. The method is illustrated with the n=4 case that leads to a rich family of eight-dimensional…

We study simple $\mathfrak{sl}(2)$-modules over $\mathbb C$ that are free of finite rank as $U(\mathfrak h)$-modules, where $\mathfrak h$ is a Cartan subalgebra of $\mathfrak{sl}(2)$. Our main result is an explicit classification of the…

Learning based hashing methods have attracted considerable attention due to their ability to greatly increase the scale at which existing algorithms may operate. Most of these methods are designed to generate binary codes preserving the…

Factorization method is developed for a family of discretely spiked harmonic oscillators. Two sets of intertwining and ladder operators are presented to algebraically generate eigenstates with energies isomorphic to those of the ordinary…

A lucasene is a hexagon chain that is similar to a fibonaccene, an $L$-fence is a poset the Hasse diagram of which is isomorphic to the directed inner dual graph of the corresponding lucasene. A new class of cubes, which named after…

We count primitive lattices of rank $d$ inside $\mathbb{Z}^{n}$ as their covolume tends to infinity, with respect to certain parameters of such lattices. These parameters include, for example, the subsapce that a lattice spans, namely its…

This paper proposes a new probabilistic classification algorithm using a Markov random field approach. The joint distribution of class labels is explicitly modelled using the distances between feature vectors. Intuitively, a class label…

We introduce a framework generalizing lattice reduction algorithms to module lattices in order to practically and efficiently solve the $\gamma$-Hermite Module-SVP problem over arbitrary cyclotomic fields. The core idea is to exploit the…

In both real and complex cases, we establish the connection of the problem about $2$-dimensional linear subspaces the most deviating from the coordinate ones with one simply formulated optimization problem for isoperimetric polygons in…

Despite the rapid advance of unsupervised anomaly detection, existing methods require to train separate models for different objects. In this work, we present UniAD that accomplishes anomaly detection for multiple classes with a unified…

Inspired by Kontsevich's graphic orbifold Euler characteristic we define a virtual Euler characteristic for any finite set of isomorphism classes of matroids of rank $r$. Our main result provides a simple formula for the virtual Euler…