Department

Sort by: Order: Results:

  • SCHOLAR-a Scientific Celebration Highlighting Open Lines of Arithmetic Research 
    Murty, R.M.; SINHA, KANEENIKA  (American Mathematical Society, 2009-04)
  • The Generalized Dedekind Determinant 
    Murty, M. Ram; SINHA, KANEENIKA (American Mathematical Society, 2010-01)
    The aim of this note is to calculate the determinants of certain matrices which arise in three different settings, namely from characters on finite abelian groups, zeta functions on lattices and Fourier coefficients of ...
  • Special values of the riemann zeta function: Some results and conjectures 
    RAGHURAM, A. (Cambridge University Press, 2015-01)
  • Covering Arrays of Strength Four and Software Testing 
    AKHTAR, YASMEEN; MAITY, SOUMEN; CHANDRASEKHARAN, RESHMA C. (Springer Nature, 2015-06)
    A covering array t− CA (n,k,g), of size n, strength t, degree k, and order g, is a k×n array on g symbols such that every t×n subarray contains every t×1 column on g symbols at least once. Covering arrays have been studied ...
  • Bilinear Cryptography Using Groups of Nilpotency Class 2 
    MAHALANOBIS, AYAN; SHINDE, PRALHAD (Springer, 2017)
    In this paper, we develop a novel idea of a bilinear cryptosystem using the discrete logarithm problem in matrices. These matrices come from a linear representation of a group of nilpotency class 2. We discuss an example ...
  • On Competing risks with masked failures 
    Dewan, Isha; NAIK-NIMBALKAR, UTTARA (Springer, 2017-12)
  • Cohomological Representations and Functorial Transfer from Classical Groups 
    RAGHURAM, A.; SARNOBAT, MAKARAND (Springer, 2018-08)
    We study whether the property of being cohomological is preserved under Langlands functoriality for the transfer of tempered representations from real classical Lie groups to an appropriate general linear group.
  • A Las Vegas Algorithm to Solve the Elliptic Curve Discrete Logarithm Problem 
    MAHALANOBIS, AYAN; MALLICK, VIVEK MOHAN; Abdullah, Ansari (Springer Nature, 2018-12)
    In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points on an elliptic curve and is thus not a generic ...
  • Quillen–Suslin theory for classical groups: Revisited over graded rings 
    BASU, RABEYA; Singh, Manish Kumar (American Mathematical Society, 2020-01)
    NA
  • Parameterized Complexity of Fair Feedback Vertex Set Problem 
    Kanesh, Lawqueen; MAITY, SOUMEN; MULUK, KOMAL; Saurabh, Saket (Springer, 2020-06)
    Given a graph G=(V,E) , a subset S⊆V(G) is said to be a feedback vertex set of G if G−S is a forest. In the Feedback Vertex Set (FVS) problem, we are given an undirected graph G, and a positive integer k, the question is ...
  • Parameterized Complexity of Satisfactory Partition Problem 
    GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2020-12)
    The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in ...
  • The Small Set Vertex Expansion Problem 
    MAITY, SOUMEN (Springer Nature, 2020-12)
    Given a graph G=(V,E) , the vertex expansion of a set S⊂V is defined as ΦV(S)=|N(S)
  • The Connected Domination Number of Grids 
    SRINIVASAN, ADARSH; Narayanaswamy, N. S. (Springer Nature, 2021-01)
    Closed form expressions for the domination number of an n×m grid have attracted significant attention, and an exact expression has been obtained in 2011 [7]. In this paper, we present our results on obtaining new lower ...
  • Parameterized Complexity of Locally Minimal Defensive Alliances 
    GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2021-01)
    A defensive alliance in a graph G=(V,E) is a set of vertices S satisfying the condition that every vertex v∈S has at least as many neighbours (including itself) in S as it has in V∖S . We consider the notion of local ...
  • Parameterized Complexity of Defensive and Offensive Alliances in Graphs 
    GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2021-01)
    In this paper we study the problem of finding small defensive and offensive alliances in a simple graph. Given a graph G=(V,E) and a subset S⊆V(G) , we denote by dS(v) the degree of a vertex v∈V in G[S], the subgraph of G ...
  • The Balanced Satisfactory Partition Problem 
    GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2021-01)
    The Satisfactory Partition problem asks whether it is possible to partition the vertex set of a given undirected graph into two parts such that each vertex has at least as many neighbours in its own part as in the other ...
  • Placement of an Obstacle for Optimizing the Fundamental Eigenvalue of Divergence Form Elliptic Operators 
    CHORWADWALA, ANISA M. H.; Roy, Souvik (Springer Nature, 2021-10)
    In this chapter, we consider an obstacle placement problem inside a disk, represented by a shape optimization problem to find the maximum or the minimum fundamental eigenvalue of a general divergence form elliptic operator. ...
  • On Structural Parameterizations of the Offensive Alliance Problem 
    GAIKWAD, AJINKYA; MAITY, SOUMEN (Springer Nature, 2021-12)
    The OFFENSIVE ALLIANCE problem has been studied extensively during the last twenty years. A set S⊆V of vertices is an offensive alliance in an undirected graph G=(V,E) if each v∈N(S) has at least as many neighbours in S ...
  • Parameterized Intractability of Defensive Alliance Problem 
    GAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT (Springer Nature, 2022-01)
    The DEFENSIVE ALLIANCE problem has been studied extensively during the last twenty years. A set R of vertices of a graph is a defensive alliance if, for each element of R, the majority of its neighbours are in R. The problem ...
  • On the Harmless Set Problem Parameterized by Treewidth 
    GAIKWAD, AJINKYA; MAITY, SOUMEN (Springer Nature, 2022-03)
    Given a graph G=(V,E), a threshold function t : V→N and an integer k, we study the HARMLESS SET problem, where the goal is to find a subset of vertices S⊆V of size at least k such that every vertex v in V has less than ...

Search Repository


Advanced Search

Browse

My Account