A. Satyanarayana Reddy

Bio: A. Satyanarayana Reddy is an academic researcher from Shiv Nadar University. The author has contributed to research in topics: Mathematics & Irreducibility. The author has an hindex of 4, co-authored 30 publications receiving 50 citations. Previous affiliations of A. Satyanarayana Reddy include Indian Institute of Technology Kanpur.

Removal of narrowband interference (PLI in ECG signal) using Ramanujan periodic transform (RPT)

Abstract: Suppression of interference from narrowband frequency signals play vital role in many signal processing and communication applications. A transform based method for suppression of narrow band interference in a biomedical signal is proposed. As a specific example Electrocardiogram (ECG) is considered for the analysis. ECG is one of the widely used biomedical signal. ECG signal is often contaminated with baseline wander noise, powerline interference (PLI) and artifacts (bioelectric signals), which complicates the processing of raw ECG signal. This work proposes an approach using Ramanujan periodic transform for reducing PLI and is tested on a subject data from MIT-BIH Arrhythmia database. A sum (E) of Euclidean error per block (e i ) is used as measure to quantify the suppression capability of RPT and notch filter based methods. The transformation is performed for different lengths (N), namely 36, 72, 108, 144, 180. Every doubling of N-points results in 50% reduction in error (E).

A Survey on Fixed Divisors

Abstract: In this article, we compile the work done by various mathematicians on the topic of the fixed divisor of a polynomial. This article explains most of the results concisely and is intended to be an exhaustive survey. We present the results on fixed divisors in various algebraic settings as well as the applications of fixed divisors to various algebraic and number theoretic problems. The work is presented in an orderly fashion so as to start from the simplest case of Z, progressively leading up to the case of Dedekind domains. We also ask a few open questions according to their context, which may give impetus to the reader to work further in this direction. We describe various bounds for fixed divisors as well as the connection of fixed divisors with different notions in the ring of integer-valued polynomials. Finally, we suggest how the generalization of the ring of integer-valued polynomials in the case of the ring of n×n matrices over Z (or Dedekind domain) could lead to the generalization of fixed divisors in that setting. keywords Fixed divisors, Generalized factorials, Generalized factorials in several variables, Common factor of indices, Factoring of prime ideals, Integer valued polynomials

Pattern polynomial graphs

Abstract: A graph X is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomialgraph. Some of the properties of the graphs which are polynomials in the pattern polynomial graph have been studied. We also identify known graph classes which are pattern polynomial graphs.

Fixed Divisor of a Multivariate Polynomial and Generalized Factorials in Several Variables

Abstract: We define new generalized factorials in several variables over an arbitrary subset $\underline{S} \subseteq R^n,$ where $R$ is a Dedekind domain and $n$ is a positive integer. We then study the properties of the fixed divisor $d(\underline{S},f)$ of a multivariate polynomial $f \in R[x_1,x_2, \ldots, x_n]$. We generalize the results of Polya, Bhargava, Gunji & McQuillan and strengthen that of Evrard, all of which relate the fixed divisor to generalized factorials of $\underline{S}$. We also express $d(\underline{S},f)$ in terms of the images $f(\underline{a})$ of finitely many elements $\underline{a} \in R^n$, generalizing a result of Hensel, and in terms of the coefficients of $f$ under explicit bases.