English
Related papers

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

200 papers

The main goal of this thesis is to study $\mathbb{K}$-uniruled sets that appear in affine geometry. At the beginning we discuss the property of $\mathbb{K}$-uniruledness and its equivalent conditions. Then we bound from above the degree of…

Algebraic Geometry · Mathematics 2015-01-05 Michał Lasoń

Given a graph $G=(V, E)$, a connected cut $\delta (U)$ is the set of edges of E linking all vertices of U to all vertices of $V\backslash U$ such that the induced subgraphs $G[U]$ and $G[V\backslash U]$ are connected. Given a positive…

Data Structures and Algorithms · Computer Science 2019-04-25 Brahim Chaourar

This work investigates the invariance of the non-necessarily finite uniform dimension and related concepts for subextensions in skew polynomial rings \mbox{$ \mathbb{S}=R[ \mathbf{\mathrm{X}}; \mathbf{\alpha} , \mathbf{\delta} ]$} of…

Rings and Algebras · Mathematics 2026-02-04 Bertrand Nguefack

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Combinatorics · Mathematics 2026-01-05 Saugata Basu , Laxmi Parida

Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…

Symbolic Computation · Computer Science 2007-05-23 Dima Grigoriev , Dmitrii V. Pasechnik

We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or…

Algebraic Geometry · Mathematics 2010-03-29 Benoit Bertrand , Frederic Bihan , Frank Sottile

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

We investigate parametrized variational problems where for each parameter the solution may originate from a different parameter-dependent function space. Our main motivation is the theory of Friedrichs' systems, a large abstract class of…

Numerical Analysis · Mathematics 2025-07-02 Christian Engwer , Mario Ohlberger , Lukas Renelt

Let $G = (V,E)$ be a graph on $n$ vertices and $f: V\rightarrow [1,n]$ a one to one map of $V$ onto the integers $1$ through $n$. Let $dilation(f) =$ max$\{ |f(v) - f(w)|: vw\in E \}$. Define the {\it bandwidth} $B(G)$ of $G$ to be the…

Combinatorics · Mathematics 2015-12-23 Tao Jiang , Zevi Miller , Derrek Yager

We use a non-linear characterization of orthonormal polynomials due to Saff in order to show that the behavior of orthonormal polynomials is determined only by its leading coefficient and its normalization. Several applications of this…

Spectral Theory · Mathematics 2021-08-11 Brian Simanek

We prove an analogue of the Yomdin-Gromov Lemma for $p$-adic definable sets and more broadly in a non-archimedean, definable context. This analogue keeps track of piecewise approximation by Taylor polynomials, a nontrivial aspect in the…

Algebraic Geometry · Mathematics 2015-10-07 R. Cluckers , G. Comte , F. Loeser

In this paper order estimates for the Kolmogorov widths of weighted Sobolev classes on a multi-dimensional domain are obtained. The classes are defined by conditions on the highest-order derivatives and the derivative of order zero.

Functional Analysis · Mathematics 2020-11-24 A. A. Vasil'eva

Let $S=K[x_1,\dots,x_n]$ be the polynomial ring over a field $K$ and $I\subset S$ be a squarefree monomial ideal generated in degree $n-2$. Motivated by the remarkable behavior of the powers of $I$ when $I$ admits a linear resolution, as…

Commutative Algebra · Mathematics 2025-08-28 Antonino Ficarra , Somayeh Moradi

This paper aims at characterizing the approximability of bounded sets in the range of nonlinear operators in Banach spaces by finite-dimensional linear varieties. In particular, the class of operators we consider includes the endpoint maps…

Optimization and Control · Mathematics 2024-07-02 Alexander Zuyev , Lihong Feng , Peter Benner

We describe the set of parameters $(p_1,p_2,q_1,q_2)$ such that the balls $B_{q_1,q_2}^{s,b}$ are rigid in $\ell_{q_1,q_2}^{s,b}$ metric i.e. they are poorly approximated by linear subspaces of dimension $\le (1-\varepsilon)sb$, for large…

Functional Analysis · Mathematics 2025-02-28 Yuri Malykhin , Konstantin Ryutin

We investigate the ratio asymptotic behavior of the sequence $(Q_{n})_{n=0}^{\infty}$ of multiple orthogonal polynomials associated with a Nikishin system of $p\geq 1$ measures that are compactly supported on the star-like set of $p+1$ rays…

Classical Analysis and ODEs · Mathematics 2019-10-08 Abey López-García , Guillermo López Lagomasino

We show that every (possibly unbounded) convex polygon $P$ in $R^2$ with $m$ edges can be represented by inequalities $p_1 \ge 0,...,p_n \ge 0,$ where the $p_i$'s are products of at most $k$ affine functions each vanishing on an edge of $P$…

Metric Geometry · Mathematics 2010-02-05 Gennadiy Averkov , Christian Bey

We prove that every digraph of circumference $l$ has DAG-width at most $l$ and this is best possible. As a consequence of our result we deduce that the $k$-linkage problem is polynomially solvable for every fixed $k$ in the class of…

Discrete Mathematics · Computer Science 2015-02-12 Jørgen Bang-Jensen , Tilde My Larsen

Using normal family arguments, we show that the degree of the first nonzero homogenous polynomial in the expansion of $n$ dimensional Euclidean harmonic $K$-quasiconformal mapping around an internal point is odd, and that such a map from…

Analysis of PDEs · Mathematics 2015-02-13 Vladimir Božin , Miodrag Mateljević

Let $G=(V,E)$ be a simple connected graph. A connected edge cover of $G$ is a subset $S\subseteq E$ such that every vertex of $G$ is incident with at least one edge in $S$ and the subgraph induced by $S$ is connected. The connected edge…

Combinatorics · Mathematics 2026-02-26 Ali Zeydi Abdian , Saeid Alikhani , Mahsa Zare