Related papers: Counting and Computing Join-Endomorphisms in Latti…
Lattice-type structures can provide a combination of stiffness with light weight that is desirable in a variety of applications. Design optimization of these structures must rely on approximations of the governing physics to render solution…
In this survey paper we study parametric versions of writing a matrix in $SL_n (\mathbb{C})$ as a product of lower and upper unitriangular matrices in interchanging order as well as generalizations to other classical groups. We give an…
In the second edition of the congruence lattice book, Problem 22.1 asks for a characterization of subsets $Q$ of a finite distributive lattice $D$ such that there is a finite lattice $L$ whose congruence lattice is isomorphic to $D$ and…
We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…
We study the generalized Lam\'e equation on an elliptic curve $E$ with multiple singularities. By restricting to the locus admitting solutions with quasi-periodic properties, we construct two curves: (i) The generalized Lam'e curve: with…
A general result by Jackson (Flat algebras and the translation of universal Horn logic to equational logic, J. Symb. Log. 73(1) (2008) 90--128) implies that the lattice of all quasivarieties of groups of exponent dividing $n$ embeds into…
One of the main questions in the theory of normal surface singularities is to understand the relations between their geometry and topology. The lattice cohomology is an important tool in the study of topological properties of a plumbed…
Let $(P,\preceq)$ be a lattice, $S$ a finite subset of $P$ and $f_1,f_2,...,f_n$ complex-valued functions on $P$. We define row-adjusted meet and join matrices on $S$ by $(S)_{f_1,...,f_n}=(f_i(x_i\wedge x_j))$ and…
We introduce and study the \emph{Lattice Distortion Problem} (LDP). LDP asks how "similar" two lattices are. I.e., what is the minimal distortion of a linear bijection between the two lattices? LDP generalizes the Lattice Isomorphism…
We present deterministic distributed algorithms for computing approximate maximum cardinality matchings and approximate maximum weight matchings. Our algorithm for the unweighted case computes a matching whose size is at least $(1-\eps)$…
In this letter we report on the unexpected possibility of applying the full-deautonomisation approach we recently proposed for predicting the algebraic entropy of second-order birational mappings, to discrete lattice equations. Moreover, we…
That finite-dimensional simple Lie algebras over the complex numbers can be classified by means of purely combinatorial and geometric objects such as Coxeter-Dynkin diagrams and indecomposable irreducible root systems, is arguably one of…
Lattice rules and polynomial lattice rules are quadrature rules for approximating integrals over the $s$-dimensional unit cube. Since no explicit constructions of such quadrature methods are known for dimensions $s > 2$, one usually has to…
Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees $\mathcal{R}_{\mathrm{T}}$, it is not known how one can characterize the degrees $\mathbf{d}\in\mathcal{R}_{\mathrm{T}}$ below which $L$ can…
Formal Concept Analysis makes the fundamental observation that any finite lattice $(L, \leq)$ is determined up to isomorphism by the restriction of the relation ${\leq} \subseteq L \times L$ to the set $J(L) \times M(L)$, where $J(L)$ is…
In the article the problem of the integrable classification of nonlinear lattices depending on one discrete and two continuous variables is studied. By integrability we mean the presence of reductions of a chain to a system of hyperbolic…
We consider $m \times s$ matrices (with $m\geq s$) in a real affine subspace of dimension $n$. The problem of finding elements of low rank in such spaces finds many applications in information and systems theory, where low rank is…
An extended derivation (endomorphism) of a (restricted) Lie algebra $L$ is an assignment of a derivation (respectively) of $L'$ for any (restricted) Lie morphism $f:L\to L'$, functorial in $f$ in the obvious sense. We show that (a) the only…
An equivalence relation in the set of all square binary matrices is described in this work. It is discussed a combinatoric problem about finding the cardinal number and the elements of the factor set according to this relation. We examine…
The methods to classify extremal unimodular lattices with given automorphisms are extended to the situation of modular lattices. A slightly more general notion than the type from the PhD thesis of Michael Juergens is the det-type. The…