Recurrent Multinomial Models for Categorical Sequences

This paper presents a model of recurrent multinomial sequences. Though there exists a quite considerable literature on modeling autocorrelation in numerical data and sequences of categorical outcomes, there is currently no systematic method of modeling patterns of recurrence in categorical sequences. This paper develops a means of discovering recurrent patterns by employing a more restrictive Markov assumption. The resulting model, which I call the recurrent multinomial model, provides a parsimonious representation of recurrent sequences, enabling the investigation of recurrences on longer time scales than existing models. The utility of recurrent multinomial models is demonstrated by applying them to the case of conversational turn-taking in meetings of the Federal Open Market Committee (FOMC). Analyses are effectively able to discover norms around turn-reclaiming, participation, and suppression and to evaluate how these norms vary throughout the course of the meeting.

On Tribonacci Functions and Gaussian Tribonacci Functions

In this work, Gaussian Tribonacci functions are defined and investigated on the set of real numbers $\mathbb{R},$ \textit{i.e}., functions $f_{G}$ $:$ $\mathbb{R}\rightarrow \mathbb{C}$ such that for all $% x\in \mathbb{R},$ $n\in \mathbb{Z},$ $f_{G}(x+n)=f(x+n)+if(x+n-1)$ where $f$ $:$ $\mathbb{R}\rightarrow \mathbb{R}$ is a Tribonacci function which is given as $f(x+3)=f(x+2)+f(x+1)+f(x)$ for all $x\in \mathbb{R}$. Then the concept of Gaussian Tribonacci functions by using the concept of $f$-even and $f$-odd functions is developed. Also, we present linear sum formulas of Gaussian Tribonacci functions. Moreover, it is showed that if $f_{G}$ is a Gaussian Tribonacci function with Tribonacci function $f$, then $% \lim\limits_{x\rightarrow \infty }\frac{f_{G}(x+1)}{f_{G}(x)}=\alpha \ $and\ $\lim\limits_{x\rightarrow \infty }\frac{f_{G}(x)}{f(x)}=\alpha +i,$ where $% \alpha $ is the positive real root of equation $x^{3}-x^{2}-x-1=0$ for which $\alpha >1$. Finally, matrix formulations of Tribonacci functions and Gaussian Tribonacci functions are given. In the literature, there are several studies on the functions of linear recurrent sequences such as Fibonacci functions and Tribonacci functions. However, there are no study on Gaussian functions of linear recurrent sequences such as Gaussian Tribonacci and Gaussian Tetranacci functions and they are waiting for the investigating. We also present linear sum formulas and matrix formulations of Tribonacci functions which have not been studied in the literature.

On Pillai’s problem with X-coordinates of Pell equations and powers of 2 II

In this paper, we show that if [Formula: see text] is the [Formula: see text]th solution of the Pell equation [Formula: see text] for some non-square [Formula: see text], then given any integer [Formula: see text], the equation [Formula: see text] has at most [Formula: see text] integer solutions [Formula: see text] with [Formula: see text] and [Formula: see text], except for the only pair [Formula: see text]. Moreover, we show that this bound is optimal. Additionally, we propose a conjecture about the number of solutions of Pillai’s problem in linear recurrent sequences.

Algorithm for implementation of the «third decision scheme» of increasing the efficiency of search and synchronization of difficult broadband noise like signals

The construction of telecommunication networks with a guaranteed level of quality of service involves assessing and ensuring the security of both the networks themselves and information flows from unauthorized access and various kinds of interference, in particular at the 1st (physical) level of the network. In this regard, research in the field of creating recurrent code sequences with improved systemic, correlation, secretive, imitation-resistant properties is constantly relevant. In particular, research in the development and application of derivative nonlinear recurrent sequences, as a central element in the developed theory of the «third decision scheme». Goal of the work is to develop an algorithm for increasing the efficiency of search and synchronization of broadband signals in the form of double derivatives of nonlinear recurrent sequences, which directly uses the features of their code structure, the properties of determinism of their auto- and cross-correlation functions. The results of the research and development of the efficiency of the algorithm for accelerated search and synchronization of broadband complex signals in the form of phase-shift keyed derivatives of nonlinear recurrent sequences, which implements the principles of the «third decision schema» The developed algorithm, based on the use of double derivatives of nonlinear recurrent sequences as wideband signals, can be applied in the construction of promising packet radio networks.