Related papers: Pseudo Quasi-3 Designs and their Applications to C…
We give extensive characterizations for an open subset of an affine space of arbitrary dimension, resp. of an inverse limit of prime spectra to be quasi-compact. Among other things weak stability, retro-compactness, and cylinder sets…
In this paper, we establish the necessary and sufficient conditions for quasi-cyclic (QC) codes with index even to be symplectic self-orthogonal. Subsequently, we present the lower and upper bounds on the minimum symplectic distances of a…
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…
Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $u^2=0$, $q=p^n$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem,…
The main goal of this paper is to study the extent of freedom one has in constructing quasi-copulas vs. copulas. Specifically, it exhibits three construction methods for quasi-copulas based on recent developments: a representation of…
Could the theories with hidden variables be employed for creation of a quantum computer? A particular scheme of quasiclassical model quantum computer structure is describe.
Let $A$ be a finite dimensional algebra over an algebraically closed field $\mathbf{k}$. If $A$ is quasi-hereditary and the projective dimensions of all standard modules are at most one, then $A$ is called left strongly quasi-hereditary. In…
We construct quasi-isometry invariants of a one-ended finitely presented group by considering the tree of cylinders of a two-ended JSJ decomposition of the group. When the group satisfies additional quasi-isometric rigidity hypotheses we…
We consider lattice tilings of $\R^n$ by a shape we call a $(\kp,\km,n)$-quasi-cross. Such lattices form perfect error-correcting codes which correct a single limited-magnitude error with prescribed maximal-magnitudes of positive error and…
Quantum computational pseudorandomness has emerged as a fundamental notion that spans connections to complexity theory, cryptography and fundamental physics. However, all known constructions of efficient quantum-secure pseudorandom objects…
This is a survey of a new type of relativistic space-time framework; the so-called quasi-metric framework. The basic geometric structure underlying quasi-metric relativity is quasi-metric space-time; this is defined as a 4-dimensional…
The notion of almost symmetric numerical semigroup was given by V. Barucci and R. Fr\"oberg. We characterize almost symmetric numerical semigroups by symmetry of pseudo-Frobenius numbers. We give a criterion for $H^*$ (the dual of $M$) to…
A $(v,k,t)$ {\em covering design}, or {\em covering}, is a family of $k$-subsets, called blocks, chosen from a $v$-set, such that each $t$-subset is contained in at least one of the blocks. The number of blocks is the covering's {\em size},…
We develop a quasisymmetric analogue of the theory of Schubert cycles, building off of our previous work on a quasisymmetric analogue of Schubert polynomials and divided differences. Our constructions result in a natural geometric…
Cyclic codes are among the most important families of codes in coding theory for both theoretical and practical reasons. Despite their prominence and intensive research on cyclic codes for over a half century, there are still open problems…
A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as…
The additive codes may have better parameters than linear codes. However, it is still a challenging problem to efficiently construct additive codes that outperform linear codes, especially those with greater distances than linear codes of…
We give a procedure to construct (quasi-)trisection diagrams for closed (pseudo-)manifolds generated by colored tensor models without restrictions on the number of simplices in the triangulation, therefore generalizing previous works in the…
Linear codes and $t$-designs are interactive with each other. It is well known that some $t$-designs have been constructed by using certain linear codes in recent years. However, only a small number of infinite families of the extended…
This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…