Searcharxiv⌕ Search

arXiv subjects

Pranjal Srivastava

Publications and source records attributed to Pranjal Srivastava.

15 recordsLinked to original sources
arXiv2026

Algorithms for Finite Group Epimorphism Testing

The Group Epimorphism Problem (GpEpi) asks, given two finite groups $G_1$ and $G_2$, whether there exists a surjective group homomorphism, or epimorphism, from $G_1$ to $G_2$. When the input groups are given by their multiplication (Cayley) tables, the problem admits a quasipolynomial-time algorithm in general, but little is known about its complexity for structured classes of finite groups. In this paper, we study the computational complexity of GpEpi for several well-studied classes of finite groups. Our main results are polynomial-time epimorphism tests for several classes of groups for which polynomial-time isomorphism testing was previously known: Groups with Abelian normal Hall subgroups with cyclic complement; Groups with (product of) elementary Abelian normal Hall subgroup with elementary Abelian complement; and Groups with some constraints on their Abelian chief factors.

cs.DS↗
arXiv2025

Provably Outlier-resistant Semi-parametric Regression for Transferable Calibration of Low-cost Air-quality Sensors

We present a case study for the calibration of Low-cost air-quality (LCAQ) CO sensors from one of the largest multi-site-multi-season-multi-sensor-multi-pollutant mobile air-quality monitoring network deployments in India. LCAQ sensors have been shown to play a critical role in the establishment of dense, expansive air-quality monitoring networks and combating elevated pollution levels. The calibration of LCAQ sensors against regulatory-grade monitors is an expensive, laborious and time-consuming process, especially when a large number of sensors are to be deployed in a geographically diverse layout. In this work, we present the RESPIRE technique to calibrate LCAQ sensors to detect ambient CO (Carbon Monoxide) levels. RESPIRE offers specific advantages over baseline calibration methods popular in literature, such as improved prediction in cross-site, cross-season, and cross-sensor settings. RESPIRE offers a training algorithm that is provably resistant to outliers and an explainable model with the ability to flag instances of model overfitting. Empirical results are presented based on data collected during an extensive deployment spanning four sites, two seasons and six sensor packages. RESPIRE code is available at https://github.com/purushottamkar/respire.

cs.LG↗
arXiv2025

Complexity of Constructing Minimal Faithful Permutation Representations for Fitting-free Groups

In this paper, we investigate the complexity of computing minimal faithful permutation representations for groups without abelian normal subgroups (a.k.a. Fitting-free groups). When our groups are given as quotients of permutation groups, we exhibit a polynomial-time algorithm for constructing such representations. Furthermore, in the setting of permutation groups, we obtain an $\textsf{NC}$ procedure for computing the minimal faithful permutation degree, and a randomized $\textsf{NC}$ ($\textsf{RNC}$) algorithm for computing a minimal faithful permutation representation. This improves upon the work of Das and Thakkar (STOC 2024, SIAM J. Comput. 2026), who established a Las Vegas polynomial-time algorithm for computing the minimal faithful permutation degree for this class in the setting of permutation groups.

cs.DS↗
arXiv2024

Approximate counting of permutation patterns

We consider the problem of counting the copies of a length-$k$ pattern $\sigma$ in a sequence $f \colon [n] \to \mathbb{R}$, where a copy is a subset of indices $i_1 < \ldots < i_k \in [n]$ such that $f(i_j) < f(i_\ell)$ if and only if $\sigma(j) < \sigma(\ell)$. This problem is motivated by a range of connections and applications in ranking, nonparametric statistics, combinatorics, and fine-grained complexity, especially when $k$ is a small fixed constant. Recent advances have significantly improved our understanding of counting and detecting patterns. Guillemot and Marx [2014] obtained an $O(n)$ time algorithm for the detection variant for any fixed $k$. Their proof has laid the foundations for the discovery of the twin-width, a concept that has notably advanced parameterized complexity in recent years. Counting, in contrast, is harder: it has a conditional lower bound of $n^{\Omega(k / \log k)}$ [Berendsohn, Kozma, and Marx, 2019] and is expected to be polynomially harder than detection as early as $k = 4$, given its equivalence to counting $4$-cycles in graphs [Dudek and Gawrychowski, 2020]. In this work, we design a deterministic near-linear time $(1+\varepsilon)$-approximation algorithm for counting $\sigma$-copies in $f$ for all $k \leq 5$. Combined with the conditional lower bound for $k=4$, this establishes the first known separation between approximate and exact pattern counting. Interestingly, while neither the sequence $f$ nor the pattern $\sigma$ are monotone, our algorithm makes extensive use of coresets for monotone functions [Har-Peled, 2006]. Along the way, we develop a near-optimal data structure for $(1+\varepsilon)$-approximate increasing pair range queries in the plane, which exhibits a conditional separation from the exact case and may be of independent interest.

cs.DS↗
arXiv2024

Projective Closure of Semigroup Algebras

This paper investigates the projective closure of simplicial affine semigroups in $\mathbb{N}^{d}$, $d \geq 2$. We present a characterization of the Cohen-Macaulay property for the projective closure of these semigroups using Gr\"{o}bner bases. Additionally, we establish a criterion, based on Gr\"{o}bner bases, for determining the Buchsbaum property of non-Cohen-Macaulay projective closures of numerical semigroup rings. Lastly, we introduce the concept of $k$-lifting for simplicial affine semigroups in $\mathbb{N}^d$, and investigate its relationship with the original simplicial affine semigroup.

math.AC↗
arXiv2023

The Frobenius Problem for the Proth Numbers

Let $n$ be a positive integer greater than $2$. We define \textit{the Proth numerical semigroup}, $P_{k}(n)$, generated by $\{k 2^{n+i}+1 \,\mid\, i \in \mathbb{N}\}$, where $k$ is an odd positive number and $k < 2^{n}$. In this paper, we introduce the Frobenius problem for the Proth numerical semigroup $P_{k}(n)$ and give formulas for the embedding dimension of $P_{k}(n)$. We solve the Frobenius problem for $P_{k}(n)$ by giving a closed formula for the Frobenius number. Moreover, we show that $P_{k}(n)$ has an interesting property such as being Wilf.

math.CO↗
arXiv2023

On Certain Gluing of semigroup rings and indispensable resolution of semigroup rings

In this paper, our aim is twofold: First, by using the technique of gluing semigroups, we give infinitely many families of a projective closure with the Cohen-Macaulay (Gorenstein) property. Also, we give an effective technique for constructing large families of one dimensional Gorenstein local rings associated to monomial curves, which supports Rossi question, saying that every Gorenstein local ring has a non-decreasing Hilbert function. In the second part, we study strong indispensable minimal free resolutions of semigroup rings, focusing on the operation of the join of affine semigroups, which provide class of examples supporting Charalambous and Thoma question on the class of lattice ideal which has a strong indispensable free resolution.

math.AC↗
arXiv2023

On Nearly Gorenstein Simplicial Semigroup Algebras

In this paper, we study the nearly Gorenstein projective closure of numerical semigroups. We also studied the nealy Gorenstein property of associated graded ring of simplicial affine semigroups. Moreover, in case of gluing of numerical semigroups, we answer the question posed by Herzog-Hibi-Stamate.

math.AC↗
arXiv2023

Join of affine semigroups

In this paper, we study the class of affine semigroup generated by integral vectors, whose components are in generalised arithmetic progression and we observe that the defining ideal is determinantal. We also give a sufficient condition on the defining ideal of the semigroup ring for the equality of the Betti numbers of the defining ideal and those of its initial ideal. We introduce the notion of an affine semigroup generated by join of two affine semigroups and show that this affine semigroup exhibits some nice properties including Cohen-Macaulayness.

math.AC↗
arXiv2023

Non-perturbative Generation of Light Antiquark Flavor Asymmetry in Proton

We compute the light antiquark flavor asymmetry in the proton using the Chiral Quark Model ($\chi_{\rm QM}$). The distribution functions for the light antiquarks $\bar{d}(x)$ and $\bar{u}(x)$ have been extracted with the help of experimental data from NuSea/E866 and HERMES for the Bjorken$-x$ range $0.015 < x < 0.35$ as well from the most recent SeaQuest data for an extended $x$ range $0.13 < x < 0.45$. Our results on the $\bar{d}(x)-\bar{u}(x)$, $\frac{\bar{d}(x)}{\bar{u}(x)}$ and Gottfried Integral $I_G$ are in agreement with the experimental data and confirm the presence of enhanced $\bar{d}$ sea whose origin is purely non-perturbative based on chiral symmetry breaking in QCD.

hep-ph↗
arXiv2023

Argument Mining using BERT and Self-Attention based Embeddings

Argument mining automatically identifies and extracts the structure of inference and reasoning conveyed in natural language arguments. To the best of our knowledge, most of the state-of-the-art works in this field have focused on using tree-like structures and linguistic modeling. But, these approaches are not able to model more complex structures which are often found in online forums and real world argumentation structures. In this paper, a novel methodology for argument mining is proposed which employs attention-based embeddings for link prediction to model the causational hierarchies in typical argument structures prevalent in online discourse.

cs.CL↗
arXiv2022

On the Associated Graded ring of Semigroup Algebras

In this paper, we give the necessary and sufficient conditions for the Cohen-Macaulayness of the associated graded ring of a simplicial affine semigroups using Gr\"{o}bner basis. We generalize the concept of homogeneous numerical semigroup for the simplicial affine semigroup and show that the Betti numbers of the corresponding semigroup ring matches with the Betti numbers of the associated graded ring. We also define the nice extension for simplicial affine semigroups, motivated by the notion of a nice extension of the numerical semigroups.

math.AC↗
arXiv2021

Projective Closure of Affine Monomial Curves II

In this paper our aim is twofold. First, we introduce the notion of star gluing of numerical semigroups and show that arithmetically Cohen-Macaulay and Gorenstein properties of the projective closure are preserved under this gluing operation. We then give a condition on Gr\"{o}bner basis of the defining ideal of an affine monomial curve which ensures that the Betti sequence of the affine curve is the same as the Betti sequence of its projective closure. We also study the effect of simple gluing on Betti sequences of the projective closure. Finally, we construct some numerical semigroups, using a gluing technique, such that the Cohen-Macaulay type of corresponding affine curve and its projective closure are both $n$.

math.AC↗
arXiv2021

Projective closures of affine monomial curves

We study the projective closures of three important families of affine monomial curves in dimension $4$, namely the Backelin curve, the Bresinsky curve and the Arslan curve, in order to explore possible connections between syzygies and the arithmetic Cohen-Macaulay property.

math.AC↗