Related papers: On the Number of Inequivalent Binary Self-Orthogon…
It is well-known that the congruence $\sum_{i=1}^{ n} i^{ n} \equiv 1 \pmod{n}$ has exactly five solutions: $\{1,2,6,42,1806\}$. In this work, we characterize the solutions to the congruence $1^n + 2^n + \dotsb + n^n\equiv p \pmod{n}$ for…
For a given irrational number, we consider the properties of best rational approximations of given parities. There are three different kinds of rational numbers according to the parity of the numerator and denominator, say odd/odd, even/odd…
A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, straightforward construction is intractable since the resulting polar bit-channels have an output alphabet that grows…
We construct bivariate orthogonal polynomials (OPs) on algebraic curves of the form $y^m = \phi(x)$ in $\mathbb{R}^2$ where $m = 1, 2$ and $\phi$ is a polynomial of arbitrary degree $d$, in terms of univariate semiclassical OPs. We compute…
In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…
This paper studies how many orthogonal bi-invariant complex structures exist on a metric Lie algebra over the real numbers. Recently, it was shown that irreducible Lie algebras which are additionally $2$-step nilpotent admit at most one…
We consider the problem of the reconstruction of a Schwarz matrix from exactly one given eigenvalue. This inverse eigenvalue problem leads to the Jacobi orthogonal polynomials~$\{P_k^{(-n,n)}\}_{k=0}^{n-1}$ that can be treated as a discrete…
We find approximate expressions x(k,n) and y(k,n) for the real and imaginary parts of the kth zero z_k=x_k+i y_k of the Bessel polynomial y_n(x). To obtain these closed-form formulas we use the fact that the points of well-defined curves in…
Monotone Boolean functions (MBFs) are Boolean functions $f: {0,1}^n \rightarrow {0,1}$ satisfying the monotonicity condition $x \leq y \Rightarrow f(x) \leq f(y)$ for any $x,y \in {0,1}^n$. The number of MBFs in n variables is known as the…
Polynomials known as Multiple Orthogonal Polynomials in a single variable are polynomials that satisfy orthogonality conditions concerning multiple measures and play a significant role in several applications such as Hermite-Pad\'e…
In this contribution, discrete semiclassical orthogonal polynomials of class $s\leq2$ are studied. By considering all possible solutions of the Pearson equation, we obtain the canonical families in each class. We also consider limit…
We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…
In this article, we construct linear codes over the commutative non-unital ring $I$ of size four. We obtain their Lee-weight distributions and study their binary Gray images. Under certain mild conditions, these classes of binary codes are…
We provide the first-ever calculation of the number of inequivalent monotone Boolean functions of 9 variables, which is equal to 789,204,635,842,035,040,527,740,846,300,252,680.
In this paper we discuss some remarkable properties of the autonomous system of 2 first-order Ordinary Differential Equations (ODEs), which equates the derivatives $\dot{x}_n(t)$ ($n = 1, 2$) of the 2 dependent variables $x_n(t)$ to the…
We consider the number of various partitions of $n$ with parts separated by parity and prove combinatorially several inequalities between these numbers. For example, we show that for $n\geq 5$ we have $p_{od}^{eu}(n)<p_{ed}^{ou}(n)$, where…
Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studied. In this paper, we provide a method of constructing…
Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was…
This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to the sizes of optimal constant-weight, binary, error-correcting…
With the aim of constructing coherent states for many-body systems consisting of six kinds of boson operators, a possible form of the orthogonal set is presented in terms of monomial with respect to state generating operators. In connection…