Related papers: A taylor-made arithmetic model of the genetic code…
Using Hecke characters, we construct two infinite families of newforms with complex multiplication, one by $\mathbb{Q}(\sqrt{-3})$ and the other by $\mathbb{Q}(\sqrt{-2})$. The values of the $p$-th Fourier coefficients of all the forms in…
In a previous paper, Rahmani introduced a new family of p-Bernoulli numbers and polynomials by means of the Gauss hypergeometric function. Motivated by this paper and as a degenerate version of those numbers and polynomials, we introduce…
We introduce a $q$-deformation of the Pythagoras equation $a^2 + b^2 = c^2$, which is a polynomial version of it different from the standard one. We construct a polynomial analogue, or ``$q$-analogue'', of every primitive Pythagorean…
Expanding genetic codes from natural standard nucleotides to artificial non-standard nucleotides marks a significant advancement in synthetic biology, with profound implications for biotechnology and medicine. Decoding the biological…
How to represent the genetic code? Despite the fact that it is extensively known, the DNA mapping into proteins remains as one of the relevant discoveries of genetics. However, modern genomic signal processing usually requires converting…
In this paper we consider the Galois covers of algebraic surfaces of degree 6, with all associated planar degenerations. We compute the fundamental groups of those Galois covers, using their degeneration. We show that for 8 types of…
Recently, degenerate Cauchy numbers and polynomials are introduced in [10]. In this paper, we study the degenerate Cauchy numbers and polynomials which are different from the previous degenerate Cauchy numbers and polynomials. In addition,…
This work deals with a new family of models, which includes the sine-Gordon model and the double-sine-Gordon, triple-sine-Gordon and so on. The investigation is based on a deformation procedure, which is used to deform a well-known model,…
Matrix forms of the representation of the multi-level system of molecular-genetic alphabets have revealed algebraic properties of this system. Families of genetic (4*4)- and (8*8)-matrices show unexpected connections of the genetic system…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
The aim of this paper is by using generating functions to further study some identities and properties on the degenerate Stirling numbers of the second kind, the degenerate $r$-Stirling numbers of the second kind, the degenerate Stirling…
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…
In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…
Here we consider the degenerate Bernstein polynomials as a degenerate version of Bernstein polynomials, which are motivated by Simsek's recent work 'Generating functions for unification of the multidimensional Bernstein polynomials and…
An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…
We study quotients of principally polarized abelian varieties with real multiplication by Galois-stable finite subgroups and describe when these quotients are principally polarizable. We use this characterization to provide an algorithm to…
We introduce a general class of codes which includes several well-known classes of deletion/insertion correcting codes as special cases. For example, the Helberg code, the Levenshtein code, the Varshamov--Tenengolts code, and most variants…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
We present a new implementation of the LLM-driven genetic algorithm {\it funsearch}, whose aim is to generate examples of interest to mathematicians and which has already had some success in problems in extremal combinatorics. Our…
Functions of chemical composition are complex and discrete in nature making it impossible to optimize them with gradient methods. Genetic algorithms, which do not use derivative information, are used to maximize the thermal conductivity of…