English
Related papers

Related papers: Notes on planar semimodular lattices. I. Construct…

200 papers

Current methods for fabricating lenses rely on mechanical processing of the lens or mold, such as grinding, machining, and polishing. The complexity of these fabrication processes and the required specialized equipment prohibit rapid…

Applied Physics · Physics 2021-07-01 Valeri Frumkin , Moran Bercovici

Semi-entwining structures are proposed as concepts simpler than entwining structures, yet they are shown to have interesting applications in constructing intertwining operators and braided algebras, lifting functors, finding solutions for…

Quantum Algebra · Mathematics 2013-05-13 Florin F. Nichita , Deepak Parashar , Bartosz Zielinski

We report on the Lattice determination of the semileptonic form factors by lattice QCD. Comparison with the light-cone QCD sum rules are made for $\Btopi, \Btorho$ semileptonic decays.

High Energy Physics - Phenomenology · Physics 2007-05-23 Tetsuya Onogi

The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…

Numerical Analysis · Mathematics 2015-06-29 Josef Dick , Peter Kritzer

Given a quadratic two-parameter matrix polynomial in Newton basis $Q_{N} (\lambda ,\mu)$, we construct a vector space of linear two-parameter matrix polynomials and identify a set of linearizations which lie in the vector space. We also…

General Mathematics · Mathematics 2025-09-16 Avisek Bist , Namita Behera

In the light of recent studies of BPS triple junctions in the Wess-Zumino model we describe techniques to construct infinite lattices using similar junctions. It is shown that whilst these states are only approximately locally BPS they are…

High Energy Physics - Theory · Physics 2008-11-26 P. M. Saffin

In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also present two efficient variants of the algorithm, one for…

Discrete Mathematics · Computer Science 2007-05-23 Vicky Choi

We describe the construction of the slice fibration of a given one.

Category Theory · Mathematics 2024-03-06 Ruggero Pagnan

In this paper, we present a simple lattice-theoretic characterization for affine buildings of type A. We introduce a class of modular lattices, called uniform modular lattices, and show that uniform modular lattices and affine buildings of…

Combinatorics · Mathematics 2019-09-20 Hiroshi Hirai

Two-dimensional spatial solitonic lattices are generated and investigated experimentally and numerically in an SBN:Ce crystal. An enhanced stability of these lattices is achieved by exploiting the anisotropy of coherent soliton interaction,…

Pattern Formation and Solitons · Physics 2007-05-23 M. Petrovic , D. Traeger , A. Strinic , M. Belic , J. Schroeder , C. Denz

Complemented lattices and uniquely complemented lattices are very important, not only in mathematics, but also in physics, biology, and even in social sciences. They have been investigated for a long time, especially by Huntington,…

History and Overview · Mathematics 2023-08-10 Daniel Parrochia

Let $L$ be a finite $n$-element semilattice. We prove that if $L$ has at least $127\cdot 2^{n-8}$ subsemilattices, then $L$ is planar. For $n>8$, this result is sharp since there is a non-planar semilattice with exactly $127\cdot 2^{n-8}-1$…

Rings and Algebras · Mathematics 2019-07-03 Gábor Czédli

We show how natural functors from the category of coherent sheaves on a projective scheme to categories of Kronecker modules can be used to construct moduli spaces of semistable sheaves. This construction simplifies or clarifies technical…

Algebraic Geometry · Mathematics 2009-11-11 Luis Álvarez-Cónsul , Alastair King

We prove that every finite distributive lattice $D$ can be represented as the congruence lattice of a rectangular lattice $K$ in which all congruences are principal. We verify this result in a stronger form as an extension theorem.

Rings and Algebras · Mathematics 2019-08-13 G. Grätzer , E. T. Schmidt

In the paper we first construct a new cotorsion pair, in the category of chain complexes, from two given cotorsion pairs in the category of modules, and then we consider completeness of such pairs under certain conditions.

Rings and Algebras · Mathematics 2014-09-30 Gang Yang , Ruijuan Du

The similar sublattices of a planar lattice can be classified via its multiplier ring. The latter is the ring of rational integers in the generic case, and an order in an imaginary quadratic field otherwise. Several classes of examples are…

Metric Geometry · Mathematics 2019-08-15 Michael Baake , Rudolf Scharlau , Peter Zeiner

We define a quasimodule Q over a bounded lattice L in an analogous way as a module over a semiring is defined. The essential difference is that L need not be distributive. Also for quasimodules there can be introduced the concepts of inner…

Rings and Algebras · Mathematics 2024-11-04 Ivan Chajda , Helmut Länger

We split the crossings of the foil knot and enumerate the resulting states with a generating polynomial. Unexpectedly, the number of such states which consist of two components are given by the lazy caterer's sequence. This sequence…

Combinatorics · Mathematics 2017-12-13 Franck Ramaharo , Fanja Rakotondrajao

In this paper we study sequences of lattices which are, up to similarity, projections of $\mathbb{Z}^{n+1}$ onto a hyperplane $\bm{v}^{\perp}$, with $\bm{v} \in \mathbb{Z}^{n+1}$ and converge to a target lattice $\Lambda$ which is…

Combinatorics · Mathematics 2013-06-11 Antonio Campello , João Strapasson

Given free modules $M\subseteq L$ of finite rank $f\geq 1$ over a principal ideal domain $R$, we give a procedure to construct a basis of $L$ from a basis of $M$ assuming the invariant factors or elementary divisors of $L/M$ are known.…

Rings and Algebras · Mathematics 2021-10-26 Fernando Szechtman