English
Related papers

Related papers: Schur Ring, Run Structure and Periodic Compatible …

200 papers

The completely regular codes in Hamming graphs have a high degree of combinatorial symmetry and have attracted a lot of interest since their introduction in 1973 by Delsarte. This paper studies the subfamily of completely transitive codes,…

Combinatorics · Mathematics 2012-10-29 Neil I. Gillespie , Michael Giudici , Cheryl E. Praeger

A new family of binary linear completely transitive (and, therefore, completely regular) codes is constructed. The covering radius of these codes is growing with the length of the code. In particular, for any integer r > 1, there exist two…

Information Theory · Computer Science 2013-03-12 J. Rifa , V. Zinoviev

Schur rings over the infinite dihedral group $\mathcal{Z}\rtimes\mathcal{Z}_2$ are studied according to properties of Schur rings over infinite groups and the classification of Schur rings over infinite cyclic groups. Schur rings over…

Combinatorics · Mathematics 2023-05-16 Gang Chen , Jiawei He , Zhiman Wu

In this paper we generalize the binary coding procedure of perfect matchings from catacondensed benzenoid graphs to catacondensed even ring systems (also called cers). Next, we study cers with isomorphic resonance graphs. For this purpose,…

Combinatorics · Mathematics 2019-11-11 Simon Brezovnik , Niko Tratnik , Petra Žigert Pleteršek

Recently the authors and J.M. Kress presented a special function recurrence relation method to prove quantum superintegrability of an integrable 2D system that included explicit constructions of higher order symmetries and the structure…

Mathematical Physics · Physics 2015-05-27 E. G. Kalnins , W. Miller,

We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…

Mathematical Physics · Physics 2013-08-23 Daniel Ueltschi

We give recurrences, generating functions and explicit exact expressions for the enumeration of fundamental quantities involving runs in binary strings. We first focus on enumerations concerning runs of ones, and we then analyse the same…

Combinatorics · Mathematics 2026-02-13 Félix Balado , Guénolé C. M. Silvestre

Schur Polynomials are families of symmetric polynomials that have been classically studied in Combinatorics and Algebra alike. They play a central role in the study of Symmetric functions, in Representation theory [Sta99], in Schubert…

Computational Complexity · Computer Science 2019-12-02 Prasad Chaugule , Mrinal Kumar , Nutan Limaye , Chandra Kanta Mohapatra , Adrian She , Srikanth Srinivasan

We show that for dual-unitary kicked chains, built upon a pair of complex Hadamard matrices, correlators of strictly local, traceless operators vanish identically for sufficiently long chains. On the other hand, operators supported at pairs…

Statistical Mechanics · Physics 2020-01-07 Boris Gutkin , Petr Braun , Maram Akila , Daniel Waltner , Thomas Guhr

We address an open problem posed by Chen-Cheng-Qi (IEEE Trans.\ Inf.\ Theory, 2025): can the decoding of binary sum-rank-metric codes $\SR(C_1,C_2)$ with $2\times2$ matrix blocks be reduced entirely to decoding the constituent…

Information Theory · Computer Science 2026-03-31 Hao Wu , Bocong Chen , Guanghui Zhang , Hongwei Liu

Let C be an additive subgroup of $\Z_{2k}^n$ for any $k\geq 1$. We define a Gray map $\Phi:\Z_{2k}^n \longrightarrow \Z_2^{kn}$ such that $\Phi(\codi)$ is a binary propelinear code and, hence, a Hamming-compatible group code. Moreover,…

Information Theory · Computer Science 2009-07-31 J. Borges , C. Fernandez-Cordoba , J. Rifa

We establish analytically several new identities connecting enumerators of different types of circulant graphs of prime, twice prime and prime-squared orders. In particular, it is shown that the semi-sum of the number of undirected…

Combinatorics · Mathematics 2010-03-17 Valery A. Liskovets

We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…

Computational Complexity · Computer Science 2024-01-22 Anuj Dawar , Gregory Wilsenach

Periodic solutions of the three body problem are very important for understanding its dynamics either in a theoretical framework or in various applications in celestial mechanics. In this paper we discuss the computation and continuation of…

Earth and Planetary Astrophysics · Physics 2017-04-04 George Voyatzis

We introduce and study modular truncations of the Ackermann function viewed as self-maps on finite rings. These maps form a hierarchy of rapidly increasing compositional complexity indexed by recursion depth. We investigate their structural…

Combinatorics · Mathematics 2026-03-27 Jean-Christophe Pain

In this work, we give three new techniques for constructing Hermitian self-dual codes over commutative Frobenius rings with a non-trivial involutory automorphism using $\lambda$-circulant matrices. The new constructions are derived as…

Combinatorics · Mathematics 2023-01-18 Adam Michael Roberts

We outline our approach to understand the family structure through the idea of a SM-like chiral fermion spectrum, one that is derivable from anomaly cancellation conditions in the same way as the one family SM, under an extended symmetry,…

High Energy Physics - Phenomenology · Physics 2007-05-23 Otto C. W. Kong

We present resolved Herschel images of circumbinary debris disks in the alpha CrB (HD139006) and beta Tri (HD13161) systems. We find that both disks are consistent with being aligned with the binary orbital planes. Though secular…

Earth and Planetary Astrophysics · Physics 2013-11-07 G. M. Kennedy , M. C. Wyatt , B. Sibthorpe , N. M. Phillips , B. Matthews , J. S. Greaves

We consider the hashing mechanism for constructing binary embeddings, that involves pseudo-random projections followed by nonlinear (sign function) mappings. The pseudo-random projection is described by a matrix, where not all entries are…

Machine Learning · Computer Science 2016-07-04 Anna Choromanska , Krzysztof Choromanski , Mariusz Bojarski , Tony Jebara , Sanjiv Kumar , Yann LeCun

We study a family of integrable systems of nonlinearly coupled harmonic oscillators on the classical and quantum levels. We show that the integrability of these systems follows from their symmetry characterized by algebras called here…

Mathematical Physics · Physics 2016-06-22 A. Odzijewicz , E. Wawreniuk
‹ Prev 1 4 5 6 7 8 10 Next ›