Related papers: Simplifying modular lattices by removing doubly ir…
Characterization of crystallographic lattices is an important tool in structure solution, crystallographic database searches and clustering of diffraction images in serial crystallography. Characterization of lattices by Niggli-reduced…
We present an approach to decomposition and factor analysis of matrices with ordinal data. The matrix entries are grades to which objects represented by rows satisfy attributes represented by columns, e.g. grades to which an image is red, a…
We present an extension to the quantifier-free theory of integer arrays which allows us to express counting. The properties expressible in Array Folds Logic (AFL) include statements such as "the first array cell contains the array length,"…
Rectangular designs are classified as regular, Latin regular, semiregular, Latin semiregular and singular designs. Some series of selfdual as well as alpharesolvable designs are obtained using matrix approaches which belong to the above…
We introduce 3-irreducible modules, even roots and odd roots for Leibniz algebras, produce a basis for a root space of a Leibniz algebra with a semisimple Lie factor, and classify finite dimensional simple Leibniz algebras with Lie factor…
In this paper we determine, under some mild restrictions, the lattice of submodules $\gL$ of a module $M$ all of whose composition factors have multiplicity one. Such a lattice is distributive, and hence determined by its poset of down-sets…
Let $\Lambda$ be a finite-dimensional $k$-algebra with $k$ algebraically closed. Bongartz has recently shown that the existence of an indecomposable $\Lambda$-module of length $n > 1$ implies that also indecomposable $\Lambda$-modules of…
The direct application of the definition of sorting in lattices is impractical because it leads to an algorithm with exponential complexity. In this paper we present for distributive lattices a recursive formulation to compute the sort of a…
Singular vectors of a representation of a finite-dimensional simple Lie algebra are weight vectors in the underlying module that are nullified by positive root vectors. In this article, we use partial differential equations to find all the…
A series of integral lattices parametrised by integers $k,m,n$ are introduced and investigated, where $n$ is the rank of the lattice, including the root lattices described in a uniform way and unimodular lattices such as the Niemeier…
In the article a classification method for nonlinear integrable equations with three independent variables is discussed based on the notion of the integrable reductions. We call the equation integrable if it admits a large class of…
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices,…
Two line arrangements in $\mathbb{CP}^2$ can have different topological properties even if they are combinatorially isomorphic. Results by Dan Cohen and Suciu and by Randell show that a reducible moduli space under complex conjugation is a…
Let $p$ be a prime. In this paper, we compute complexities of some simple modules of symmetric groups labelled by two-part partitions. Most of the simple modules considered here are contained in the $p$-blocks with non-abelian defect…
In this paper, we study the moduli spaces of canonical threefolds with any prescribed geometric genus $p_g \ge 5$ which have the smallest possible canonical volume. This minimal volume is equal to the smallest half-integer that is larger…
A numerical irreducible decomposition for a polynomial system provides representations for the irreducible factors of all positive dimensional solution sets of the system, separated from its isolated solutions. Homotopy continuation methods…
The analysis of a total least square problem (TLS) can be reduced to that of an associated core problem, which typically has lower dimension and improved solubility properties. Nevertheless, even a core problem may remain reducible,…
The first step in elliptic curve scalar multiplication algorithms based on scalar decompositions using efficient endomorphisms-including Gallant-Lambert-Vanstone (GLV) and Galbraith-Lin-Scott (GLS) multiplication, as well as…
In this article we describe cell decompositions of the moduli space of Riemann surfaces and their relationship to a Hurwitz problem. The cells possess natural linear structures and with respect to this they can be described as rational…
With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which…