Related papers: Regular coverings in filter and ideal lattices
We propose a generalized Riemann-Hilbert-Birkhoff decomposition that expands the standard integrable hierarchy formalism in two fundamental ways: it allows for integer powers of Lax matrix components in the flow equations to be increased as…
In this paper, we study the congruences, prime filters and prime ideals of horizontal sums of bounded lattices, then, through a construction based on horizontal sums and without enforcing the Continuum Hypothesis, we are modifying an…
The aim of this paper is to study lattice-like coverings with congruent translation balls and the packings and coverings with a type of translation cylinders in Sol space related to the fundamental lattices. We introduce the notions of the…
Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…
Zilber's Theorem states that a finite lattice $L$ is planar if{}f it has a complementary order relation. We provide a new proof for this crucial result and discuss some applications, including a canonical form for finite planar lattices and…
Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…
We extend Latimer and MacDuffee's theorem to a general commutative domain and apply this result to study similarity of matrices over integral rings of number fields. We also conjecture similarity over discrete valuation rings can be descent…
This note is a follow-up to \cite{bt}. We focus on conditions under which a normed lattice $X$ is majorizing in its norm completion. We show that \cite[Question 8.17]{bt} -- namely, whether this holds whenever every norm-null sequence in…
This thesis describes the development of the density matrix embedding theory (DMET) and its applications to lattice strongly correlated electron problems, including a review of DMET theory and algorithms (Ch 2), investigation of finite size…
A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…
Let $f:X \rightarrow \Delta $ be a one-parameter semistable degeneration of $m$-dimensional compact complex manifolds. Assume that each component of the central fiber $X_0$ is K\"ahler. Then, we provide a criterion for a general fiber to…
We derive results on the distribution of directions of saddle connections on translation surfaces using only the Birkhoff ergodic theorem applied to the geodesic flow on the moduli space of translation surfaces. Our techniques, together…
These lecture notes for a graduate class present the regularization theory for linear and nonlinear ill-posed operator equations in Hilbert spaces. Covered are the general framework of regularization methods and their analysis via spectral…
In aperiodic order, non-periodic but "ordered" objects such as tilings, Delone sets, functions and measures are investigated. In this article we depict the common structure of these objects by using the general framework of abstract pattern…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…
In this paper we prove several results about the lattice of imprimitivity systems of a permutation group containing a cyclic subgroup with at most two orbits. As an application we generalize the first Ritt theorem about functional…
Let X\subset PP^n be a projective scheme over a field, and let phi:X --> Y be a finite morphism. Our main result is a formula in terms of global data for the maximum of the Castelnuovo-Mumford regularity of the fibers of \phi, considered as…
We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…
The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…