English
Related papers

Related papers: On $(n,\sigma)-$equivalence relation between skew …

200 papers

We study the rate of convergence of the Markov chain on $S_n$ which starts with a random $(n-k)$-cycle for a fixed $k \geq 1$, followed by random transpositions. The convergence to the stationary distribution turns out to be of order $n$.…

Probability · Mathematics 2018-03-26 Alperen Y. Özdemir

Szlach\'anyi's skew monoidal categories are a well-motivated variation of monoidal categories in which the unitors and associator are not required to be natural isomorphisms, but merely natural transformations in a particular direction. We…

Logic in Computer Science · Computer Science 2020-03-12 Tarmo Uustalu , Niccolò Veltri , Noam Zeilberger

By using the notion of $d$-embedding $\Gamma$ of a (canonical) subgeometry $\Sigma$ and of exterior set with respect to the $h$-secant variety $\Omega_{h}(\mathcal{A})$ of a subset $\mathcal{A}$, $ 0 \leq h \leq n-1$, in the finite…

Information Theory · Computer Science 2024-05-03 Nicola Durante , Giovanni Giuseppe Grimaldi , Giovanni Longobardi

Given an $N$-dimensional compact manifold $M$ and a field $\bk$, F. Cohen and L. Taylor have constructed a spectral sequence, $\cE(M,n,\bk)$, converging to the cohomology of the space of ordered configurations of $n$ points in $M$. The…

Algebraic Topology · Mathematics 2007-05-23 Yves Felix , Daniel Tanré

Let $\mathbb{F}_{p^{m}}$ be a finite field with cardinality $p^{m}$ and $R=\mathbb{F}_{p^{m}}+u\mathbb{F}_{p^{m}}$ with $u^{2}=0$. We aim to determine all $\alpha+u\beta$-constacyclic codes of length $np^{s}$ over $R$, where…

Information Theory · Computer Science 2016-06-22 Wei Zhao , Xilin Tang , Ze Gu

For a fixed permutation $\sigma \in S_k$, let $N_{\sigma}$ denote the function which counts occurrences of $\sigma$ as a pattern in permutations from $S_n$. We study the expected value (and $d$-th moments) of $N_{\sigma}$ on conjugacy…

Combinatorics · Mathematics 2021-11-12 Christian Gaetz , Christopher Ryba

We introduce the notion of quantum-symmetric equivalence of two connected graded algebras, based on Morita-Takeuchi equivalences of their universal quantum groups, in the sense of Manin. We study homological and algebraic invariants of…

Quantum Algebra · Mathematics 2024-04-02 Hongdi Huang , Van C. Nguyen , Charlotte Ure , Kent B. Vashaw , Padmini Veerapen , Xingting Wang

The study of frequency-hopping sequences (FHSs) has been focused on the establishment of theoretical bounds for the parameters of FHSs as well as on the construction of optimal FHSs with respect to the bounds. Peng and Fan (2004) derived…

Information Theory · Computer Science 2016-05-12 Bocong Chen , Liren Lin , San Ling , Hongwei Liu

We compare two different techniques for proving non-Shannon-type information inequalities. The first one is the original Zhang-Yeung's method, commonly referred to as the copy/pasting lemma/trick. The copy lemma was used to derive the first…

Information Theory · Computer Science 2013-02-14 Tarik Kaced

Let $\mathcal{R}_e$ be a finite commutative chain ring with nilpotency index $e \geq 2.$ In this paper, all repeated-root constacyclic codes of arbitrary lengths over $\mathcal{R}_{2},$ their sizes and their dual codes are determined. As an…

Commutative Algebra · Mathematics 2017-09-25 Anuradha Sharma , Tania Sidana

A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized…

Information Theory · Computer Science 2021-07-12 Gerardo Vega , Félix Hernández

Professor Cunsheng Ding gave cyclotomic constructions of cyclic codes with length being the product of two primes. In this paper, we study the cyclic codes of length $n=2^e$ and dimension $k=2^{e-1}$. Clearly, Ding's construction is not…

Information Theory · Computer Science 2018-08-21 Binbin Pang , Shixin Zhu , Ping Li

We study cyclic codes with arbitrary length over Fp+vFp where theta(v)=av, a in Fp and v^2=0. We characterize all existing codes in case of O(theta)|n by using certain projections from (Fp+vFp)[x;theta] to Fp[x]. We provide an explicit…

Rings and Algebras · Mathematics 2016-07-06 Reza Dastbasteh , Seyyed Hamed Mousavi , Javad Haghighat

While equality of skew Schur functions is well understood, the problem of determining when two skew Schur $Q$ functions are equal is still largely open. It has been studied in the case of ribbon shapes in 2008 by Barekat and van…

Combinatorics · Mathematics 2021-08-27 Maria Gillespie , Kyle Salois

This paper provides a comprehensive analysis of almost maximum distance separable (AMDS) constacyclic codes of length $4p^{\varsigma}$ over the finite field $\mathbb{F}_{p^m}$, where $p$ is an odd prime number. Furthermore, it introduces…

Combinatorics · Mathematics 2026-05-25 Manasa K J , Divya Acharya , Prasanna Poojary

This article studies the set of R-equivalence classes of the group of proper projective similitudes of an algebra with involution of the first kind. The main results concern base fields of characteristic different from 2 over which every…

Number Theory · Mathematics 2026-02-26 M. Archita , Karim Johannes Becher

We establish a supercongruence conjectured by Almkvist and Zudilin, by proving a corresponding $q$-supercongruence. Similar $q$-supercongruences are established for binomial coefficients and the Ap\'{e}ry numbers, by means of a general…

Number Theory · Mathematics 2019-12-03 Ofir Gorodetsky

Let $\texttt{R}$ be a commutative finite chain ring of invariants $(q,s).$ In this paper, the trace representation of any free cyclic $\texttt{R}$-linear code of length $\ell,$ is presented, via the $q$-cyclotomic cosets modulo $\ell,$ when…

Information Theory · Computer Science 2017-02-06 Alexandre Fotue Tabue , Christophe Mouaha

Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…

Information Theory · Computer Science 2025-04-22 Mrinal Kanti Bose , Udaya Parampalli , Abhay Kumar Singh

We construct fermionic conformal field theories (CFTs) whose spectra are characterized by quantum stabilizer codes. We exploit our construction to search for fermionic CFTs with supersymmetry by focusing on quantum stabilizer codes of the…

High Energy Physics - Theory · Physics 2023-08-04 Kohki Kawabata , Tatsuma Nishioka , Takuya Okuda