arXiv subjects

Chetan Patil

Publications and source records attributed to Chetan Patil.

4 recordsLinked to original sources

arXiv2026

On $S$-prime and $S$-primary elements in multiplicative lattices

In this paper, we study $S$-prime elements and $S$-primary elements within the framework of multiplicative lattices. Furthermore, we define and explore weakly $S$-prime elements and weakly $S$-primary elements, which generalize weakly prime elements and weakly primary elements in multiplicative lattices respectively. We show that the weakly $S$-prime ideals (weakly $S$-primary ideals) of a commutative ring $R$ with $1$ correspond precisely to the weakly $S_L$-prime elements (weakly $S$-primary elements) of the ideal lattice $Id(R)$ of $R$, where $S_L = \{(s) \mid s \in S\}$.

math.AC↗

arXiv2026

On $S$-Noetherian Lattices

In this paper, we define and study $S$-Noetherian lattices as a natural generalization of Noetherian rings. We prove that a ring $R$ is $S$-Noetherian if and only if its ideal lattice, $Id(R)$, is $S_L$-Noetherian. Furthermore, we establish a Cohen-Kaplansky type theorem for $S$-Noetherian lattices, showing that $L$ is $S$-Noetherian if and only if every $S$-prime element of $L$ is $S$-compact. Finally, we introduce the concept of $S$-primary elements-a generalization of primary elements in multiplicative lattices and demonstrate the existence and uniqueness of $S$-primary decomposition in $S$-Noetherian lattices.

math.AC↗

arXiv2026

On $S$-Prime Element Principle

In this paper, we introduce $S$-prime elements in $V$-lattices, where $S$ is a multiplicatively closed subset of a $V$-lattice $L$. In addition, we introduce the $S$-Prime Element Principle to prove that certain elements in $V$-lattices are $S$-prime elements. This principle leads to a direct and uniform approach to the results on the existence of prime elements in multiplicative lattices when $S=\{1\}$.

math.AC↗

arXiv2017

Multiple-Instance, Cascaded Classification for Keyword Spotting in Narrow-Band Audio

We propose using cascaded classifiers for a keyword spotting (KWS) task on narrow-band (NB), 8kHz audio acquired in non-IID environments -- a more challenging task than most state-of-the-art KWS systems face. We present a model that incorporates Deep Neural Networks (DNNs), cascading, multiple-feature representations, and multiple-instance learning. The cascaded classifiers handle the task's class imbalance and reduce power consumption on computationally-constrained devices via early termination. The KWS system achieves a false negative rate of 6% at an hourly false positive rate of 0.75

cs.LG↗