Related papers: Constructing 2-uninorms on bounded lattices by usi…
The so-called min-sum algorithm has been applied for decoding lattices constructed by Construction D'. We generalize this iterative decoding algorithm to decode lattices constructed by Construction D. An upper bound on the decoding…
It is shown in this paper that non-conforming finite elements on the triangle using $P^{1}$-nonconforming polynomials and $P^{2}$ -conforming polynomials can be easily built and used.They appear as an 'enriched' version of the standard…
A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…
We introduce a systematic method for constructing a class of lattice structures that we call ``partial line graphs''.In tight-binding models on partial line graphs, energy bands with flat energy dispersions emerge.This method can be applied…
Here we look at (collections of) semimetrics and seminorms, including their ultrametric versions. In particular, we are concerned with geometric properties related to connectedness and topological dimension 0.
We re-address the problem of construction of new infinite-dimensional completely integrable systems on the basis of known ones, and we reveal a working mechanism for such transitions. By splitting the problem's solution in two steps, we…
We describe how optical dressing can be used to generate bandstructures for ultracold atoms with non-trivial Z_2 topological order. Time reversal symmetry is preserved by simple conditions on the optical fields. We first show how to…
We provide new families of minimal codes in any characteristic. Also, an inductive construction of minimal codes is presented.
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…
We give a uniform explicit construction of finite two-generator presentations for the special linear groups over the integers in all ranks at least three. The construction builds on the generating-pair work of Conder--Liversidge--Vsemirnov…
We demonstrate a construction method based on a gain function that is defined on the incidence graph of an incidence geometry. Restricting to when the incidence geometry is a linear space, we show that the construction yields a generalized…
In this work, we investigate additive complementary dual (ACD) codes and their construction over finite fields $\mathbb{F}_{q^2}$ with respect to the trace inner products, where $q$ is a prime power. First, we associate an additive code…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
A general method for constructing essential uniform algebras with prescribed properties is presented. Using the method, the following examples are constructed: an essential, natural, regular uniform algebra on the closed unit disc; an…
Previous work identifying depth-optimal $n$-channel sorting networks for $9\leq n \leq 16$ is based on exploiting symmetries of the first two layers. However, the naive generate-and-test approach typically applied does not scale. This paper…
It is known that a tilting generator on an algebraic variety $X$ gives a derived equivalence between $X$ and a certain non-commutative algebra. In this paper, we explain a method to construct a tilting generator from an ample line bundle,…
Imaging is critical to the characterisation of materials. However, even with careful sample preparation and microscope calibration, imaging techniques are often prone to defects and unwanted artefacts. This is particularly problematic for…
In this paper we propose a general ternary construction of lattices from three rows and ternary codes. Most laminated lattices and Kappa lattices in ${\bf R}^n$, $n\leq 24$ can be recovered from our tenary construction naturally. This…
This paper investigates flat webs on the projective plane. We present two methods for constructing such webs: the first involves taking the product of finitely many convex reduced foliations and invariant lines, while the second consists of…