Related papers: Some further construction methods for uninorms via…
We present a generic and systematic approach for constructing D-dimensional lattice models with exactly solvable d-dimensional boundary states localized to corners, edges, hinges and surfaces. These solvable models represent a class of…
We develop a simple and general method to construct arbitrary Flat Band lattices. We identify the basic ingredients behind zero-dispersion bands and develop a method to construct extended lattices based on a consecutive repetition of a…
Sixteen new linear codes are presented: three of them improve the lower bounds on the minimum distance for a linear code and the rest are an explicit construction of unknown codes attaining the lower bounds on the minimum distance. They are…
We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and in which the meet operation of the semilattice coexists with a generalized distance function in a tightly coordinated way. We prove a…
The famous Barnes-Wall lattices can be obtained by applying Construction D to a chain of Reed-Muller codes. By applying Construction ${{D}}^{{(cyc)}}$ to a chain of extended cyclic codes sandwiched between Reed-Muller codes, Hu and Nebe (J.…
In this paper, we study some topological characteristics of the n-normed spaces. We observe convergence sequences, closed sets, and bounded sets in the n-normed spaces using norms of quotient spaces that will be constructed. These norms…
By employing non-equispaced grid points near boundaries, boundary-optimized upwind finite-difference operators of orders up to nine are developed. The boundary closures are constructed within a diagonal-norm summation-by-parts (SBP)…
Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…
We propose some new method of constructing configurations, which consists in consecutive inscribing copies of one underlying configuration. A uniform characterization of the obtained class and the one introduced in our paper untitled…
Over the last few years lattice techniques have been used to investigate candidate theories of new physics beyond the Standard Model. This review gives a survey of results from these studies. Most of these investigations have been of…
Targeting to use contract-based design for the specification and refinement of extra-functional properties, this research abstract suggests to use type constraints and dependent types to ensure correct and consistent top-down decomposition…
In this work, we provide some constructions and the sum of new continuous K-g-frames in Hilbert$C^{\ast}$-Modules. We provide certain necessary and sufficient conditions for some adjointable operators on $\mathcal{H}$, under which new…
We present a method for constructing bounded strictly singular non-compact operators on mixed Tsirelson spaces defined either by the families (A_n) or (S_n) of a certain class, as well as on spaces built on them, including hereditarily…
In the past decade, we had developed a series of splitting contraction algorithms for separable convex optimization problems, at the root of the alternating direction method of multipliers. Convergence of these algorithms was studied under…
Collective versions of order convergences and corresponding types of collectively qualified sets of operators in vector lattices are investigated. It is proved that collectively order to norm bounded sets are bounded in the operator norm…
In a recent paper, G. Cz\'edli and E.\,T. Schmidt present a structure theorem for planar semimodular lattices. In this note, we present an alternative proof.
We describe several new ways of specifying the behaviour of Lemaitre-Tolman (LT) models, in each case presenting the method for obtaining the LT arbitrary functions from the given data, and the conditions for existence of such solutions. In…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
An internal symmetry in a lattice model is said to be onsiteable if it can be disentangled into an onsite action by introducing ancillas and conjugating with a finite-depth circuit. A standard lore holds that onsiteability is equivalent to…
In this paper we construct constant dimension space codes with prescribed minimum distance. There is an increased interest in space codes since a paper by Koetter and Kschischang were they gave an application in network coding. There is…