◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Pasechnik

7 papers hereh-index 2335.7k citations124 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • middle author1
  • last author5

Across the 7 of 7 papers where every author was matched, so the position is known.

fields
  • math.CO2
  • cs.SC1
  • math.GR1
  • math.MG1
  • math.NT1
  • math.OC1

identity via Semantic Scholar / OpenAlex

activity
19992009
most citedOn semidefinite programming relaxations of the traveling salesman problem

42 citations · 84 across the 3 of their papers we have counts for

collaborators
Showing 2004 · math.NTShow all

1 paper · 2 filters

math.NT2004

On the irreducibility of a truncated binomial expansion

Michael Filaseta, Angel Kumchev, Dmitrii V. Pasechnik

Let P_nk(x) denote the sum of the lowest k+1 terms in the expansion of (1+x)^n. We investigate the irreducibility of P_nk(x) and more general univariate polynomials related to it.…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.