English
Related papers

Related papers: Ratios of Norms for Polynomials and Connected n-wi…

200 papers

In 2005, Boman et al introduced the concept of factor width for a real symmetric positive semidefinite matrix. This is the smallest positive integer $k$ for which the matrix $A$ can be written as $A=VV^T$ with each column of $V$ containing…

Optimization and Control · Mathematics 2021-01-14 João Gouveia , Alexander Kovačec , Mina Saee

Let $I$ be a graded ideal of a standard graded polynomial ring $S$ with coefficients in a field $K$. The asymptotic behaviour of the $\text{v}$-number of the powers of $I$ is investigated. Natural lower and upper bounds which are linear…

Commutative Algebra · Mathematics 2023-10-10 Antonino Ficarra , Emanuele Sgroi

In this article, we obtain the order estimates for the Kolmogorov widths of sets with conditions on the norm in the weighted Sobolev space $W^r_{p_1}$ and in the weighted space $L_{p_0}$.

Functional Analysis · Mathematics 2022-06-22 A. A. Vasil'eva

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…

Combinatorics · Mathematics 2017-01-26 Pierre-Yves Bienvenu

Recently, Okounkov, Lazarsfeld and Mustata, and Kaveh and Khovanskii have shown that the growth of a graded linear series on a projective variety over an algebraically closed field is asymptotic to a polynomial. We give a complete…

Algebraic Geometry · Mathematics 2012-12-27 Steven Dale Cutkosky

Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic $k$-uniform hypergraphs of bounded complexity, showing that for each $\epsilon>0$ the vertex set can be equitably partitioned into a bounded number of parts…

Combinatorics · Mathematics 2016-10-17 Jacob Fox , Janos Pach , Andrew Suk

In this paper we prove that Kolmogorov widths of weighted Sobolev classes with restrictions $f(a)=\dots=f^{(k-1)}(a)=f^{(k)}(b)=\dots=f^{(r-1)}(b)=0$ in a weighted Lebesgue space and spectral numbers of some non-linear differential equation…

Classical Analysis and ODEs · Mathematics 2017-09-20 A. A. Vasil'eva

We prove asymptotic formulas for the behavior of approximation, Gelfand, Kolmogorov and Weyl numbers of Sobolev embeddings between Besov and Triebel-Lizorkin spaces defined on quasi-bounded domains.

Functional Analysis · Mathematics 2015-06-16 Shun Zhang , Alicja Gąsiorowska

In this paper we consider the problem of finding the {\em densest} subset subject to {\em co-matroid constraints}. We are given a {\em monotone supermodular} set function $f$ defined over a universe $U$, and the density of a subset $S$ is…

Data Structures and Algorithms · Computer Science 2012-07-31 Venkatesan T. Chakaravarthy , Natwar Modani , Sivaramakrishnan R. Natarajan , Sambuddha Roy , Yogish Sabharwal

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Metric Geometry · Mathematics 2022-03-23 Brett Leroux , Luis Rademacher

In this paper, we investigate the Bohr radius for $K$-quasiregular sense-preserving harmonic mappings $f=h+\overline{g}$ in the unit disk $\mathbb{D}$ such that the translated analytic part $h(z)-h(0)$ is quasi-subordinate to some analytic…

Complex Variables · Mathematics 2020-04-21 Ming-Sheng Liu , Saminathan Ponnusamy , Jun Wang

We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge…

Discrete Mathematics · Computer Science 2024-11-19 Yury Kartynnik , Andrew Ryzhikov

Suppose $G$ is a simple graph with $n$ vertices, $m$ edges, and rank $r$. Let $\chi_G(t)=a_0t^n-a_1t^{n-1}+\cdots +(-1)^ra_rt^{n-r}$ be the chromatic polynomial of $G$. For $q,k\in \Bbb{Z}$ and $0\le k\le q+r+1$, we obtain a sharp two-side…

Combinatorics · Mathematics 2015-09-03 Suijie Wang , Yeong-Nan Yeh , Fengwei Zhou

We prove that the roots of a smooth monic polynomial with complex-valued coefficients defined on a bounded Lipschitz domain $\Omega$ in $\mathbb R^m$ admit a parameterization by functions of bounded variation uniformly with respect to the…

Classical Analysis and ODEs · Mathematics 2021-04-06 Adam Parusinski , Armin Rainer

This paper presents a comprehensive survey of 18 distinct polynomials and their potential applications in Kolmogorov-Arnold Network (KAN) models as an alternative to traditional spline-based methods. The polynomials are classified into…

Machine Learning · Computer Science 2024-10-15 Seyd Teymoor Seydi

Let $K$ be a non-polar compact subset of $\mathbb{R}$ and $\mu_K$ denote the equilibrium measure of $K$. Furthermore, let $P_n\left(\cdot, \mu_K\right)$ be the $n$-th monic orthogonal polynomial for $\mu_K$. It is shown that…

Classical Analysis and ODEs · Mathematics 2016-03-25 Gökalp Alpan

We study the asymptotic behavior of the Castelnuovo-Mumford regularity along chains of graded ideals in increasingly larger polynomial rings that are invariant under the action of symmetric groups. A linear upper bound for the regularity of…

Commutative Algebra · Mathematics 2020-09-09 Dinh Van Le , Uwe Nagel , Hop D. Nguyen , Tim Roemer

Let $f:\mathbb{K}^n\rightarrow\mathbb{K}^m$ be a generically finite polynomial map of degree $d$ between affine spaces. In arXiv:1411.5011 we proved that if $\mathbb{K}$ is the field of complex or real numbers, then the set $S_f$ of points…

Algebraic Geometry · Mathematics 2021-04-06 Zbigniew Jelonek , Michał Lasoń

The aim of this paper is to start the study of images of graded polynomials on full matrix algebras. We work with the matrix algebra $M_n(K)$ over a field $K$ endowed with its canonical $\mathbb{Z}_n$-grading (Vasilovsky's grading). We…

Rings and Algebras · Mathematics 2023-01-10 Lucio Centrone , Thiago Castilho de Mello

We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…

Complex Variables · Mathematics 2019-07-02 Johan Andersson , Linnea Rousu
‹ Prev 1 3 4 5 6 7 10 Next ›