Related papers: A construction of (t,s)-sequences with finite-row …
Let $S=(C \times D)/G$ be a surface isogenous to a higher product of unmixed type with $p_g=q=0$, $G=(\mathbb{Z}/2)^3$ or $(\mathbb{Z}/2)^4$. We construct exceptional sequences of maximal length and quasiphantom categories on $S$.
Linear codes are widely employed in communication systems, consumer electronics, and storage devices. All linear codes over finite fields can be generated by a generator matrix. Due to this, the generator matrix approach is called a…
We present a new construction of ordered orthogonal arrays (OOA) of strength $t$ with $(q + 1)t$ columns over a finite field $\mathbb{F}_{q}$ using linear feedback shift register sequences (LFSRs). OOAs are naturally related to $(t, m,…
We call a function constructible if it has a globally subanalytic domain and can be expressed as a sum of products of globally subanalytic functions and logarithms of positively-valued globally subanalytic functions. For any $q > 0$ and…
This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…
The idea of generating integrals analogous to generating functions is first introduced in this paper. A new proof of the well-known Finite Harmonic Series Theorem in Analysis and Analytical Number Theory is then obtained by the method of…
Sum-rank-metric codes have wide applications in universal error correction, multishot network coding, space-time coding and the construction of partial-MDS codes for repair in distributed storage. Fundamental properties of sum-rank-metric…
Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…
This work is motivated by the long-standing open problem of designing asymptotically order-optimal aperiodic polyphase sequence sets with respect to the celebrated Welch bound. Attempts were made by Mow over 30 years ago, but a…
Exact solutions construction in scalar fields cosmology is of growing interest. In this work we review the results which obtained with the help of one of the most effective method. Namely, the method of generating functions for exact…
Let S=(s_1,s_2,..., s_m) and T = (t_1,t_2,..., t_n) be vectors of non-negative integers with sum_{i=1}^{m} s_i = sum_{j=1}^n t_j. Let B(S,T) be the number of m*n matrices over {0,1} with j-th row sum equal to s_j for 1 <= j <= m and k-th…
It is shown that any finitely generated subring of a global field has a universal first-order definition in its fraction field. This covers Koenigsmann's result for the ring of integers and its subsequent extensions to rings of integers in…
Given integers s and t, define a function phi_{s,t} on the space of all formal complex series expansions by phi_{s,t} (sum a_n x^n) = sum a_{sn+t} x^n. We define an integer r to be distinguished with respect to (s,t) if r and s are…
For a simple connected graph $G$, the $Q$-generating function of the numbers $N_k$ of semi-edge walks of length $k$ in $G$ is defined by $W_Q(t)=\sum\nolimits_{k = 0}^\infty {N_k t^k }$. This paper reveals that the $Q$-generating function…
We give asymptotic expressions for the number of commuting matrices over finite fields. For this, we use product expansions for the corresponding generating functions.
We construct harmonic maps into SU(1,1)/U(1) starting from Smyth potentials \xi, by the DPW method, In this method, harmonic maps are obtained from the Iwasawa factorization of a solution L of L^{-1} dL = \xi. However, the Iwasawa…
We propose a superfast method for constructing orthogonal matrices $M\in\mathcal{O}(n,q)$ in finite fields $GF(q)$. It can be used to construct $n\times n$ orthogonal matrices in $Z_p$ with very high values of $n$ and $p$, and also…
The Fermat numbers have many notable properties, including order universality, coprimality, and definition by a recurrence relation. We use arbitrary elliptic curves and rational points of infinite order to generate sequences that are…
In this paper, we have considered a quadratic variation of the deceleration parameter ($q$) as a function of cosmic time ($t$) which describes a smooth transition from the decelerating phase of the Universe to an accelerating one and also…
In this paper, we introduce the generating functions of partition sequences. Partition sequences have a one-to-one correspondence with partitions. Therefore, the generating function has no multiplicity and appears meaningless initially.…