English
Related papers

Related papers: A Multi-Dimensional Block-Circulant Perfect Array …

200 papers

A new method to construct $q$-ary complementary sequence (or array) sets (CSSs) and complete complementary codes (CCCs) of size $N$ is introduced in this paper. An algorithm on how to compute the explicit form of the functions in…

Information Theory · Computer Science 2020-05-13 Zilong Wang , Dongxu Ma , Guang Gong

Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory and cryptography. In this paper, some new series…

Combinatorics · Mathematics 2023-12-20 Guangzhou Chen , Xiaodong Niu , Jiufeng Shi

We study the conformational properties of complex polymer macromolecules, consisting in general of $n$ subsequently connected chains (blocks) of different lengths and distinct chemical structure. Depending on the solvent conditions, the…

Soft Condensed Matter · Physics 2019-12-03 V. Blavatska , K. Haydukivska

A. Girand has constructed an explicit two-parameter family of flat connections over the complex projective plane $\mathbb{P}^2$. These connections have dihedral monodromy and their polar locus is a prescribed quintic composed of a conic and…

Algebraic Geometry · Mathematics 2019-07-29 Arata Komyo

We develop a theory of nearby and vanishing cycles in the context of finite-coefficient Zariski-constructible sheaves over a non-archimedean field which is non-trivially valued, complete, algebraically closed, and of mixed characteristic or…

Algebraic Geometry · Mathematics 2025-04-24 Tong Zhou

Given n red and n blue points in general position in the plane, it is well-known that there is a perfect matching formed by non-crossing line segments. We characterize the bichromatic point sets which admit exactly one non-crossing…

Computational Geometry · Computer Science 2017-07-28 Andrei Asinowski , Tillmann Miltzow , Günter Rote

Block copolymer (BCP) melt assembly has been the subject of decades of study, with focus largely on self-organized spatial patterns of periodically-ordered segment density. In this study, we demonstrate that underlying these otherwise…

Soft Condensed Matter · Physics 2017-06-21 Ishan Prasad , Youngmi Seo , Lisa M. Hall , Gregory M. Grason

We revisit zigzag array codes, a family of MDS codes known for achieving optimal access and optimal rebuilding ratio in single-node repair. In this work, we endow zigzag codes with two new properties: small field size and low skip cost.…

Information Theory · Computer Science 2025-09-30 Wenqin Zhang , Han Mao Kiah , Son Hoang Dau

Diffuse two-dimensional integer-valued arrays are demonstrated that have delta-like aperiodic autocorrelation and, simultaneously, the array sums form delta-like projections along several directions. The delta-projected views show a single…

Image and Video Processing · Electrical Eng. & Systems 2021-11-15 I. D. Svalbe , D. M. Paganin , T. C. Petersen

The complexity class PPA consists of NP-search problems which are reducible to the parity principle in undirected graphs. It contains a wide variety of interesting problems from graph theory, combinatorics, algebra and number theory, but…

Computational Complexity · Computer Science 2017-11-15 Aleksandrs Belovs , Gábor Ivanyos , Youming Qiao , Miklos Santha , Siyi Yang

A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based on a branch decomposition. It was introduced by Norine and…

Combinatorics · Mathematics 2019-02-15 Meike Hatzel , Roman Rabinovich , Sebastian Wiederrecht

This paper introduces a new variant of hypercubes, which we call Z-cubes. The n-dimensional Z-cube $H_n$ is obtained from two copies of the (n-1)-dimensional Z-cube $H_{n-1}$ by adding a special perfect matching between the vertices of…

Combinatorics · Mathematics 2015-09-24 Xuding Zhu

Associative division algebras are a rich source of fully diverse space-time block codes (STBCs). In this paper the systematic construction of fully diverse STBCs from nonassociative algebras is discussed. As examples, families of fully…

Information Theory · Computer Science 2012-02-07 Susanne Pumpluen , Thomas Unger

A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…

Combinatorics · Mathematics 2020-08-05 Edita Máčajová , Martin Škoviera

A family of stabilizer-free $P_k$ virtual elements are constructed on triangular meshes. When choosing an accurate and proper interpolation, the stabilizer of the virtual elements can be dropped while the quasi-optimality is kept. The…

Numerical Analysis · Mathematics 2023-11-14 Xuejun Xu , Shangyou Zhang

Nine new 2-D OOCs are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions…

Information Theory · Computer Science 2009-11-03 Reza Omrani , Gagan Garg , P. Vijay Kumar , Petros Elia , Pankaj Bhambhani

A one-dimensional cluster model with next-nearest-neighbor interactions and two additional composite interactions is solved; the free energy is obtained and a correlation function is derived exactly. The model is diagonalized by a…

Statistical Mechanics · Physics 2021-01-14 Yuji Yanagihara , Kazuhiko Minami

We show how to develop an expansion of nearly oblate systems in terms of a set of potential-density pairs. A harmonic (multipole) structure is imposed on the potential set at infinity, and the density can be made everywhere regular. We…

Astrophysics · Physics 2015-06-24 Dave Syer

Multiplicative bundle gerbes are gerbes over a Lie group which are compatible with the group structure. In this article connections on such bundle gerbes are introduced and studied. It is shown that multiplicative bundle gerbes with…

Differential Geometry · Mathematics 2010-04-20 Konrad Waldorf

For any integer $\rho \geq 1$ and for any prime power q, the explicit construction of a infinite family of completely regular (and completely transitive) q-ary codes with d=3 and with covering radius $\rho$ is given. The intersection array…

Information Theory · Computer Science 2008-10-29 J. Rifa , V. A. Zinoviev
‹ Prev 1 8 9 10 Next ›