Related papers: Completely (Quasi-)Uniform Nested Boolean Steiner …
A binary extended 1-perfect code $\mathcal C$ folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for $\mathcal C$, distinguishes among the 361…
A new class of fully decoupled consistent splitting schemes for the Navier-Stokes equations are constructed and analyzed in this paper. The schemes are based on the Taylor expansion at $t^{n+\beta}$ with $\beta\ge 1$ being a free parameter.…
In this article, families of non-linear subdivision schemes are presented that are based on univariate polynomials up to degree three. Theses families of schemes are constructed by using dynamic iterative re-weighed least squares method.…
If $S$ is a transitive metric space, then $|C|\cdot|A| \le |S|$ for any distance-$d$ code $C$ and a set $A$, ``anticode'', of diameter less than $d$. For every Steiner S$(t,k,n)$ system $S$, we show the existence of a $q$-ary…
In this paper, the quasi-constant modulus (QCM) property is analyzed and leveraged in the design of nonlinearity-tolerant four-dimensional (4D) modulation formats. Accordingly, we propose a family of QCM-based quadrature amplitude…
Quantum secret sharing (QSS) allows a dealer to distribute a secret quantum state among a set of parties so that certain subsets can reconstruct the secret, while unauthorized subsets obtain no information. While QSS was introduced over…
Recently, skyrmions with integer topological charges have been observed numerically but have not yet been shown rigorously on two-component systems of nonlinear Schrodinger equations (NLSE) describing a binary mixture of Bose-Einstein…
Unitary designs are essential tools in several quantum information protocols. Similarly to other design concepts, unitary designs are mainly used to facilitate averaging over a relevant space, in this case, the unitary group…
Sample-based quantum diagonalization (SQD) is an algorithm for hybrid quantum-classical molecular simulation that has been of broad interest for application with noisy intermediate scale quantum (NISQ) devices. However, SQD does not always…
We investigate computing models that are presented as families of finite computing devices with a uniformity condition on the entire family. Examples of such models include Boolean circuits, membrane systems, DNA computers, chemical…
We show that a squeezed bath, that acts on the central element of a harmonic chain, can drive the whole system to a steady state featuring a series of nested entangled pairs of oscillators that, ideally, covers the whole chain regardless of…
The structure theory for the quadratic algebra generated by first and second order constants of the motion for 2D second order superintegrable systems with nondegenerate (3-parameter) and or 2-parameter potentials is well understood, but…
In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended…
In this paper, we develop two fully nonconforming (both H(grad curl)-nonconforming and H(curl)-nonconforming) finite elements on cubical meshes which can fit into the Stokes complex. The newly proposed elements have 24 and 36 degrees of…
Nodal structures (NSrs) where energy bands meet to be degenerate in the Brillouin zone (BZ) in the form of point, line or surface, received immense research interest in the past decade. However, the nearly NSrs with negligible gaps, can…
Mixed elements meshes based on the modified octree approach contain several co-spherical point configurations. While generating Delaunay tessellations to be used together with the finite volume method, it is not necessary to partition them…
This paper describes a non-homogeneous distributed storage systems (DSS), where there is one super node which has a larger storage size and higher reliability and availability than the other storage nodes. We propose three distributed…
Equivariant neural networks (ENNs) have been shown to be extremely effective in applications involving underlying symmetries. By construction ENNs cannot produce lower symmetry outputs given a higher symmetry input. However, symmetry…
The Steiner Tree Problem (STP) is a well-known NP-hard combinatorial optimization problem, which has wide applications in network design, integrated circuit layout, bioinformatics, and other fields. However, traditional algorithms often…
Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First,…