default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDA. V. Prymak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j14]Feng Dai, András Kroó, Andriy Prymak
:
On Bernstein- and Marcinkiewicz-type inequalities on multivariate Cα-domains. J. Approx. Theory 305: 106101 (2025)- 2024
- [j13]Andrii Arman, Andriy V. Bondarenko, Andriy Prymak, Danylo V. Radchenko:
Upper Bounds on Chromatic Number of $\mathbb{E}^n$ in Low Dimensions. Electron. J. Comb. 31(2) (2024) - [j12]Feng Dai, Andriy Prymak:
Optimal Polynomial Meshes Exist on any Multivariate Convex Domain. Found. Comput. Math. 24(3): 989-1018 (2024) - 2023
- [j11]Feng Dai, A. V. Prymak, A. Shadrin, Vladimir N. Temlyakov, Sergey Tikhonov:
On the cardinality of lower sets and universal discretization. J. Complex. 76: 101726 (2023) - [j10]Andriy Prymak:
A New Bound for Hadwiger's Covering Problem in \(\boldsymbol{\mathbb{E}}^3\). SIAM J. Discret. Math. 37(1): 17-24 (2023) - 2021
- [j9]Andriy Prymak:
Geometric computation of Christoffel functions on planar convex domains. J. Approx. Theory 268: 105603 (2021) - 2016
- [j8]Kirill A. Kopotun, Dany Leviatan, Andriy Prymak, Igor A. Shevchuk:
Yet another look at positive linear operators, q-monotonicity and applications. J. Approx. Theory 210: 1-22 (2016) - 2015
- [j7]Oleksandr Maizlish, A. V. Prymak:
Convex polynomial approximation in Rd with Freud weights. J. Approx. Theory 192: 60-68 (2015) - 2012
- [j6]Andriy V. Bondarenko, Dany Leviatan, Andriy Prymak:
Pointwise estimates for 3-monotone approximation. J. Approx. Theory 164(9): 1205-1232 (2012) - 2010
- [j5]G. A. Dzyubenko, Kirill A. Kopotun, A. V. Prymak:
Three-monotone spline approximation. J. Approx. Theory 162(12): 2168-2183 (2010) - 2009
- [j4]Kirill A. Kopotun, Dany Leviatan, A. V. Prymak:
Nearly monotone and nearly convex approximation by smooth splines in Lp, p>0. J. Approx. Theory 160(1-2): 103-112 (2009) - 2008
- [j3]Zeev Ditzian, A. V. Prymak:
Ul'yanov-type inequality for bounded convex sets in Rd. J. Approx. Theory 151(1): 60-85 (2008) - [j2]Kirill A. Kopotun, Dany Leviatan, A. V. Prymak:
Constrained Spline Smoothing. SIAM J. Numer. Anal. 46(4): 1985-1997 (2008) - 2005
- [j1]Dany Leviatan, A. V. Prymak:
On 3-monotone approximation by piecewise polynomials. J. Approx. Theory 133(2): 147-172 (2005)
Informal and Other Publications
- 2023
- [i8]Andriy Prymak, Jaskaran Singh:
Whitney-type estimates for convex functions. CoRR abs/2311.00912 (2023) - 2022
- [i7]Feng Dai, András Kroó, Andriy Prymak:
On Bernstein- and Marcinkiewicz-type inequalities on multivariate Cα-domains. CoRR abs/2204.02349 (2022) - [i6]Feng Dai, Andriy Prymak:
Optimal polynomial meshes exist on any multivariate convex domain. CoRR abs/2205.14111 (2022) - [i5]Feng Dai, Andriy Prymak:
Polynomial approximation on C2-domains. CoRR abs/2206.01544 (2022) - [i4]Feng Dai, A. V. Prymak, A. Shadrin, Vladimir N. Temlyakov, Sergey Tikhonov:
On cardinality of the lower sets and universal discretization. CoRR abs/2208.02113 (2022) - 2020
- [i3]Feng Dai, Andriy Prymak, A. Shadrin, Vladimir N. Temlyakov, S. Yu. Tikhonov:
Sampling discretization of integral norms. CoRR abs/2001.09320 (2020) - [i2]Feng Dai, Andriy Prymak:
Lp-Bernstein inequalities on C2-domains. CoRR abs/2010.06728 (2020) - [i1]Feng Dai, Andriy Prymak:
On directional Whitney inequality. CoRR abs/2010.08374 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
