227 citations
- Bielefeld UniversityDE10 papers
- Centre National de la Recherche ScientifiqueFR9 papers
- Seoul National UniversityKR9 papers
- Institute of Nuclear Physics of LyonFR8 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR8 papers
- Lahore University of Management SciencesPK8 papers
- University of RegensburgDE8 papers
- COMSATS University IslamabadPK7 papers
- Institut de Physique des 2 Infinis de LyonFR7 papers
- Pakistan Institute of Nuclear Science and TechnologyPK6 papers
- Quaid-i-Azam UniversityPK6 papers
- Université de LyonFR6 papers
7 papers · 1 filter
Generalizations of Nekrasov-Okounkov Identity
Amer Iqbal, Shaheen Nazir, Zahid Raza +1
Nekrasov-Okounkov identity gives a product representation of the sum over partitions of a certain function of partition hook length. In this paper we give several generalizations o…
Lexsegment ideals are sequentially Cohen-Macaulay
Muhammad Ishaq
The associated primes of an arbitrary lexsegment ideal are determined. As application it is shown that is a pretty clean module, therefore, …
Dynamical friction of massive objects in galactic centres
A. Just, F. M. Khan, P. Berczik +2
Dynamical friction leads to an orbital decay of massive objects like young compact star clusters or Massive Black Holes in central regions of galaxies. The dynamical friction force…
An algorithm for primary decomposition in polynomial rings over the integers
Gerhard Pfister, Afshan Sadiq, Stefan Steidel
We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polyn…
Stanley decompositions in localized polynomial rings
Sumiya Nasir, Asia Rauf
We introduce the concept of Stanley decompositions in the localized polynomial ring where is a product of variables, and we show that the Stanley depth does not decrease…
Parallelization of Modular Algorithms
Nazeran Idrees, Gerhard Pfister, Stefan Steidel
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gröbner bases (resp. standard bases) and the modular com…