14.2k citations
- Pennsylvania State UniversityUS156 papers
- Tata Institute of Fundamental ResearchIN156 papers
- Cardiff UniversityGB146 papers
- Centre National de la Recherche ScientifiqueFR144 papers
- Max Planck Institute for Gravitational PhysicsDE143 papers
- California Institute of TechnologyUS136 papers
- Inter-University Centre for Astronomy and AstrophysicsIN134 papers
- Leibniz University HannoverDE133 papers
- Montclair State UniversityUS133 papers
- University of BirminghamGB133 papers
- University of MississippiUS133 papers
- University of FloridaUS131 papers
17 papers · 1 filter
Magnetars From Magnetized Cores Created by a Strong Interaction Phase Transition
N. D. Hari Dass, Vikram Soni
We consider a model where the strong magnetic fields of magnetars arise from a high baryon density, magnetized core. In this framework magnetars are distinguished from pulsars by t…
Syzygies of surfaces of general type
P. Banagere, Krishna Hanumanthu
We prove new results on projective normality, normal presentation and higher syzygies for a surface of general type embedded by adjoint line bundles , where i…
The Hamiltonian constraint in Polymer Parametrized Field Theory
Alok Laddha, Madhavan Varadarajan
Recently, a generally covariant reformulation of 2 dimensional flat spacetime free scalar field theory known as Parameterised Field Theory was quantized using Loop Quantum Gravity…
Some Tractable Win-Lose Games
Samir Datta, Nagarajan Krishnamurthy
Determining a Nash equilibrium in a -player non-zero sum game is known to be PPAD-hard (Chen and Deng (2006), Chen, Deng and Teng (2009)). The problem, even when restricted to w…
Dependence of Betti Numbers on Characteristic
Kia Dalili, Manoj Kummini
We study the dependence of graded Betti numbers of monomial ideals on the characteristic of the base field. The examples we describe include bipartite ideals, Stanley--Reisner idea…
Popularity at Minimum Cost
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
We consider an extension of the {\em popular matching} problem in this paper. The input to the popular matching problem is a bipartite graph G = (A U B,E), where A is a set of peop…