Related papers: Cyclic Group Projection for Enumerating Quasi-Cycl…

Continuing from a companion article: 'Random walks and contracting elements I: Deviation inequality and limit laws', we study random walks on metric spaces with contracting elements. We prove that random subgroups of the isometry group of a…

For a linear Hamming metric code of length n over a finite field, the number of distinct weights of its codewords is at most n. The codes achieving the equality in the above bound were called full weight spectrum codes. In this paper we…

We introduce a formula for determining the number of codewords of weight 2 in cyclic codes and provide results related to the count of codewords with weight 3. Additionally, we establish a recursive relationship for binary cyclic codes that…

Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that…

In this work, we introduce new methods for the quantization, decomposition, and extraction (from electromagnetic simulations) of lumped-element circuit models for superconducting quantum devices. Our flux-charge symmetric procedures center…

This paper is concerned with nonparametric estimation of the weighted stochastic block model. We first show that the model implies a set of multilinear restrictions on the joint distribution of edge weights of certain subgraphs involving…

In this paper, we study skew cyclic codes with arbitrary length over the ring $R=\mathbb{F}_{p}+u\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$. We characterize all skew cyclic codes of length $n$ as left $% R[x;\theta…

Mining dense quasi-cliques is a well-known clustering task with applications ranging from social networks over collaboration graphs to document analysis. Recent work has extended this task to multiple graphs; i.e. the goal is to find groups…

This paper presents a quasigroup encryptor that has very good scrambling properties. We show that the output of the encryptor maximizes the output entropy and the encrypted output for constant and random inputs is very similar. The system…

Quasiperiodic systems are important space-filling ordered structures, without decay and translational invariance. How to solve quasiperiodic systems accurately and efficiently is of great challenge. A useful approach, the projection method…

Compression of integer sets and sequences has been extensively studied for settings where elements follow a uniform probability distribution. In addition, methods exist that exploit clustering of elements in order to achieve higher…

We show that numerical quasi-one-dimensional renormalization group allows accurate study of weakly coupled chains with modest computational effort. We perform a systematic comparison with exact diagonalization results in two and three-leg…

Motivated by the study of resolvent estimates in the presence of trapping, we prove a semiclassical propagation theorem in a neighborhood of a compact invariant subset of the bicharacteristic flow which is isolated in a suitable sense.…

A quasiperiodic packing Q of interpenetrating copies of C, most of them only partially occupied, can be defined in terms of the strip projection method for any icosahedral cluster C. We show that in the case when the coordinates of the…

The diffraction pattern of a quasicrystal admits as symmetry group a finite group G, and there exists a G-cluster C (a union of orbits of G) such that the quasicrystal can be regarded as a quasiperiodic packing of copies of C, generally,…

We detail for the first time a complete explicit description of the quasi-cyclic structure of all classical finite generalized quadrangles. Using these descriptions we construct families of quasi-cyclic LDPC codes derived from the…

We introduce the first example of algebraically constructed hierarchical quasi-cyclic codes. These codes are built from Reed-Solomon codes using a 1964 construction of superimposed codes by Kautz and Singleton. We show both the number of…

Model reduction is a central topic in systems biology and dynamical systems theory, for reducing the complexity of detailed models, finding important parameters, and developing multi-scale models for instance. While perturbation theory is a…

We present a family of reducible cyclic codes constructed as the direct sum of two different semiprimitive two-weight irreducible cyclic codes. This family generalizes the class of reducible cyclic codes that was reported in the main result…

In this study, we address the challenge of solving elliptic equations with quasiperiodic coefficients. To achieve accurate and efficient computation, we introduce the projection method, which enables the embedding of quasiperiodic systems…