Related papers: A Recursive Block Pillar Structure in the Kolakosk…

In 2021, Augot, Couvreur, Lavauzelle and Neri introduced a new class of rank metric codes which can be regarded as rank metric counterparts of Reed-Muller codes. Given a finite Galois extension $\mathbb{L} / \mathbb{K}$, these codes are…

For a graph $G$ on $[n]$, the $k$-cut complex $\Delta_k(G)$ has facets $[n]\setminus T$, where $T$ ranges over the disconnected $k$-vertex induced subgraphs of $G$. Bayer, Denker, Jeli\'c Milutinovi\'c, Sundaram, and Xue proved that the…

Individual Kekule valence structures of biphenylene and related hydrocarbons are comparatively studied in respect of their total pi-electron energies and thereby relative stabilities. These structures are modeled as sets of…

The coded trace reconstruction problem asks to construct a code $C\subset \{0,1\}^n$ such that any $x\in C$ is recoverable from independent outputs ("traces") of $x$ from a binary deletion channel (BDC). We present binary codes of rate…

The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…

This note tells you how to construct a k(n)-dimensional family of (isomorphism classes of) irreducible representations of dimension n for the three string braid group B_3, where k(n) is an admissible function of your choosing; for example…

While Kronecker coefficients $g(\lambda,\mu,\nu)$ with bounded rows are polynomial-time computable via lattice-point methods, no explicit closed-form formulas have been obtained for genuinely three-row cases in the 87 years since…

We equip $\mathrm{BP} \langle n \rangle$ with an $\mathbb{E}_3$-$\mathrm{BP}$-algebra structure, for each prime $p$ and height $n$. The algebraic $K$-theory of this ring is of chromatic height exactly $n+1$, and the map…

We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…

We give recurrence relations for the enumeration of symmetric elements within four classes of arc diagrams corresponding to certain involutions and set partitions whose blocks contain no consecutive integers. These arc diagrams are…

We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…

Kaprekar's Routine is an iteration process that, with each iteration, sorts the digits of a number in descending and ascending orders and uses their difference for the next iteration. In this paper, we successfully address the structure of…

It is well known that Sobolev-type orthogonal polynomials with respect to measures supported on the real line satisfy higher-order recurrence relations and these can be expressed as a (2N+1)-banded symmetric semi-infinite matrix. In this…

Starting from a dynamical system $(\Omega,G)$, with $G$ a generic topological group, we devise algorithms that generate families of patterns in the Euclidean space, which densely embed $G$ and on which $G$ acts continuously by rigid shifts.…

In this paper, we design a family of $[n,k,d]$ block circulant codes that consist of many $[n_0 \ll n,k_0 \ll k,d_0]$ local codes and that satisfy three properties: (1) the code supports distributed erasure decoding, (2) $d$ can be scaled…

Recently, the first author generalized a formula of Nekrasov and Okounkov which gives a combinatorial formula, in terms of hook lengths of partitions, for the coefficients of certain power series. In the course of this investigation, he…

The finite ring Z_k = Z(+,.) mod p^k of residue arithmetic with odd prime power modulus is analysed. The cyclic group of units G_k in Z_k(.) has order (p-1)p^{k-1}, implying product structure G_k = A_k B_k. Here core A_k of order p-1 is an…

We introduce N=1 supersymmetric generalization of the mechanical system describing a particle with fractional spin in D=1+2 dimensions and being classically equivalent to the formulation based on the Dirac monopole two-form. The model…

Although two pion decays of $K$, $D$ and $B$ have similar isospin structures, there are dramatic differences in the ratios $R_K$ and $R_{D,B}$ of amplitudes from $\Delta I =3/2$ and $\Delta I =1/2$ interactions. In $K\to \pi\pi$ decays…

Collatz conjecture is generalized to $3n+3^k$ ($k\in N$). Operating as usual, every sequence seems to reach $3^k$ and end up in the loop $3^k, 4.3^k, 2.3^k,3^k$. The usual $3n+1$ conjecture is recovered for $k=0$. For $k>0$, we noticed the…