English
Related papers

Related papers: Irrational mixed decomposition and sharp fewnomial…

200 papers

An irreducible algebraic decomposition $\cup_{i=0}^{d}X_i=\cup_{i=0}^{d} (\cup_{j=1}^{d_i}X_{ij})$ of an affine algebraic variety X can be represented as an union of finite disjoint sets $\cup_{i=0}^{d}W_i=\cup_{i=0}…

Algebraic Geometry · Mathematics 2010-10-18 Shawki Al-Rashed , Gerhard Pfister

We count the algebraic numbers of fixed degree by their $\mathbf{w}$-weighted $l_p$-norm which generalizes the na\"ive height, the length, the Euclidean and the Bombieri norms. For non-negative integers $k,l$ such that $k+2l\leq n$ and a…

Number Theory · Mathematics 2019-10-08 Friedrich Götze , Denis Koleda , Dmitry Zaporozhets

For a general family of graphs on $\mathbb{Z}^n$, we translate the edge-isoperimetric problem into a continuous isoperimetric problem in $\mathbb{R}^n$. We then solve the continuous isoperimetric problem using the Brunn-Minkowski inequality…

Combinatorics · Mathematics 2016-08-24 Emmanuel Tsukerman , Ellen Veomett

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

Differential Geometry · Mathematics 2023-09-07 Brendan Guilfoyle , Wilhelm Klingenberg

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…

Algebraic Geometry · Mathematics 2016-12-16 Pinaki Mondal

We use a generalization of Vinogradov's mean value theorem of S. Parsell, S. Prendiville and T. Wooley and ideas of W. Schmidt to give nontrivial bounds for the number of solutions to polynomial congruences, for arbitrary polynomials, when…

Number Theory · Mathematics 2013-02-27 Bryce Kerr

We investigate families of subsets of $\omega$ with almost disjoint refinements in the classical case as well as with respect to given ideals on $\omega$. More precisely, we study the following topics and questions: 1) Examples of…

Logic · Mathematics 2015-10-21 Barnabás Farkas , Yurii Khomskii , Zoltán Vidnyánszky

We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…

Complex Variables · Mathematics 2024-09-20 Vahagn Aslanyan

Given $k\in N$, a nonnegative function $f\in C^r[a,b]$, $r\ge 0$, an arbitrary finite collection of points $\big\{\alpha_i\big\}_{i\in J} \subset [a,b]$, and a corresponding collection of nonnegative integers $\big\{m_i\big\}_{i\in J}$ with…

Classical Analysis and ODEs · Mathematics 2023-05-04 German Dzyubenko , Kirill A. Kopotun

A word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whenever $w_1=\texttt{1}$, $1\leq w_k\leq w_{k-1}+1$, and $w_{k-1}\neq w_{k}$ for $k=2, \dots, n$. It can be associated to a $n$-column Motzkin polyomino whose…

Combinatorics · Mathematics 2024-06-25 Jean-Luc Baril , Sergey Kirgizov , José L. Ramírez , Diego Villamizar

Let $P=\{p_{1},\ld,p_{r}\}\subset\Q[n_{1},\ld,n_{m}]$ be a family of polynomials such that $p_{i}(\Z^{m})\sle\Z$, $i=1,\ld,r$. We say that the family $P$ has {\it PSZ property} if for any set $E\sle\Z$ with…

Dynamical Systems · Mathematics 2007-10-26 Vitaly Bergelson , Alexander Leibman , Emmanuel Lesigne

Let $q$ be a prime, $P \geq 1$ and let $N_q(P)$ denote the number of rational primes $p \leq P$ that split in the imaginary quadratic field $\mathbb{Q}(\sqrt{-q})$. The first part of this paper establishes various unconditional and…

Number Theory · Mathematics 2020-08-04 Alexander Dunn , Bryce Kerr , Igor E. Shparlinski , Alexandru Zaharescu

In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (\dmm), on the isolated roots of polynomial systems, specifically on the minimum distance between any two such roots. The bounds exploit the…

Symbolic Computation · Computer Science 2010-07-26 Ioannis Z. Emiris , Bernard Mourrain , Elias Tsigaridas

We study intermediate sums, interpolating between integrals and discrete sums, which were introduced by A. Barvinok [Computing the Ehrhart quasi-polynomial of a rational simplex, Math. Comp. 75 (2006), 1449--1466]. For a given semi-rational…

Combinatorics · Mathematics 2014-01-14 Velleda Baldoni , Nicole Berline , Matthias Köppe , Michèle Vergne

We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…

Data Structures and Algorithms · Computer Science 2023-12-08 David Gamarnik , Devin Smedira

We consider discrete best approximation problems in the setting of tropical algebra, which is concerned with the theory and application of algebraic systems with idempotent operations. Given a set of input--output pairs of an unknown…

Numerical Analysis · Mathematics 2025-11-18 Nikolai Krivulin

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…

Discrete Mathematics · Computer Science 2018-02-27 Dominik Wojtczak

Let $K$ be an algebrically closed field and let $n\geq 1$. If $P\in K[X]=K[X_1,\ldots,X_n]$, $P\neq 0$, we denote by $I(P)$ the support of $P$, which is the finite subset of $\mathbb N^n$ such that $P=\sum_{i\in I(P)}a_iX^i$ with $a_i\in…

Commutative Algebra · Mathematics 2010-08-31 Constantin-Nicolae Beli

A special case of the Menshov--Rademacher theorem implies for almost all polynomials $x_1Z+\ldots +x_d Z^{d} \in {\mathbb R}[Z]$ of degree $d$ for the Weyl sums satisfy the upper bound $$ \left| \sum_{n=1}^{N}\exp\left(2\pi i \left(x_1…

Number Theory · Mathematics 2020-03-20 Changhao Chen , Igor E. Shparlinski

We prove the discrete analogue of Kakeya conjecture over $\mathbb{R}^n$. This result suggests that a (hypothetically) low dimensional Kakeya set cannot be constructed directly from discrete configurations. We also prove a generalization…

Combinatorics · Mathematics 2014-09-04 Ruixiang Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›