English
Related papers

Related papers: Real Polynomial Rings and Domain Invariance

200 papers

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

Symbolic Computation · Computer Science 2007-05-23 Cyril Brunie , Philippe Saux Picart

The Initial Algebra Theorem by Trnkov\'a et al.~states, under mild assumptions, that an endofunctor has an initial algebra provided it has a pre-fixed point. The proof crucially depends on transfinitely iterating the functor and in fact…

Logic in Computer Science · Computer Science 2022-02-15 Jiří Adámek , Stefan Milius , Lawrence S. Moss

We introduce a notion of graph homeomorphisms which uses the concept of dimension and homotopy for graphs. It preserves the dimension of a subbasis, cohomology and Euler characteristic. Connectivity and homotopy look as in classical…

General Topology · Mathematics 2014-01-14 Oliver Knill

D'Alembert made the first serious attempt to prove the Fundamental Theorem of Algebra (FTA) in 1746. An elementary proof of (FTA) based on the same idea is given in Proofs from THE BOOK. We give a shorter and more transperant version of…

Complex Variables · Mathematics 2013-05-31 Tord Sjödin

Consider a degree-$d$ polynomial $f(\xi_1,\dots,\xi_n)$ of independent Rademacher random variables $\xi_1,\dots,\xi_n$. To what extent can $f(\xi_1,\dots,\xi_n)$ concentrate on a single point? This is the so-called polynomial…

Combinatorics · Mathematics 2025-05-30 Zhihan Jin , Matthew Kwan , Lisa Sauermann , Yiting Wang

We establish a generalization of Bourgain double recurrence theorem by proving that for any map $T$ acting on a probability space $(X,\mathcal{A},\mu)$, and for any non-constant polynomials $P, Q$ mapping natural numbers to themselves, for…

Dynamical Systems · Mathematics 2020-08-12 el Houcein el Abdalaoui

The structure of the set of positivity-preserving maps between matrix algebras is notoriously difficult to describe. The notable exceptions are the results by St{\o}rmer and Woronowicz from 1960s and 1970s settling the low dimensional…

Functional Analysis · Mathematics 2015-12-11 Guillaume Aubrun , Stanisław J. Szarek

This is a mathematical commentary on Teichm{\"u}ller's paper ``Bestimmung der extremalen quasikonformen Abbildungen bei geschlossenen orientierten Riemannschen Fl{\"a}chen'' (Determination of extremal quasiconformal maps of closed oriented…

Geometric Topology · Mathematics 2015-10-12 Annette A'Campo-Neuen , Norbert A'Campo , Vincent Alberge , Athanase Papadopoulos

We study algebraic dynamical systems (and, more generally, $\sigma$-varieties) $\Phi:{\mathbb A}^n_{\mathbb C} \to {\mathbb A}^n_{\mathbb C}$ given by coordinatewise univariate polynomials by refining a theorem of Ritt. More precisely, we…

Dynamical Systems · Mathematics 2012-12-11 Alice Medvedev , Thomas Scanlon

In this paper we introduce techniques from complex harmonic analysis to prove a weaker version of the Geometric Arveson-Douglas Conjecture for complex analytic subsets that is smooth on the boundary of the unit ball and intersects…

Functional Analysis · Mathematics 2016-01-29 Ronald G. Douglas , Yi Wang

This paper treats a holomorphic self-mapping f: Omega --> Omega of a bounded domain Omega in a separable Hilbert space H with a fixed point p. In case the domain is convex, we prove an infinite-dimensional version of the…

Complex Variables · Mathematics 2007-05-23 Joseph Cima , Ian Graham , Kang-Tae Kim , Steven G. Krantz

To study the question of whether every two-dimensional Pr\"ufer domain possesses the stacked bases property, we consider the particular case of the Pr\"ufer domains formed by integer-valued polynomials. The description of the spectrum of…

Commutative Algebra · Mathematics 2018-10-10 Jacques Boulanger , Jean-Luc Chabert

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

Number Theory · Mathematics 2016-01-27 Nikos Frantzikinakis , Bernard Host

Signature-based algorithms have become a standard approach for Gr\"obner basis computations for polynomial systems over fields, but how to extend these techniques to coefficients in general rings is not yet as well understood. In this…

Symbolic Computation · Computer Science 2019-05-28 Maria Francis , Thibaut Verron

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

Motivated by the question of whether a random polynomial with integer coefficients is likely to be irreducible, we study the probability that a monic polynomial with integer coefficients has a low-degree factor over the integers, which is…

Probability · Mathematics 2018-05-23 Sean O'Rourke , Philip Matchett Wood

Numerous problems of analysis (real and complex) and geometry (analytic, algebraic, Diophantine e.a.) can be reduced to calculation of the ``number of solutions'' of systems of equations, defined by algebraic equalities and differential…

Classical Analysis and ODEs · Mathematics 2023-02-08 Dmitry Novikov , Sergei Yakovenko

Let $V$ be a two-dimensional vector space over a field $\mathbb F$ of characteristic not $2$ or $3$. We show there is a canonical surjection $\nu$ from the set of suitably generic commutative algebra structures on $V$ modulo the action of…

Commutative Algebra · Mathematics 2016-12-20 M. Rausch de Traubenberg , M. Slupinski

This paper presents an expository reverse-mathematical analysis of two fundamental theorems in commutative algebra: Hilbert's Nullstellensatz and Basis Theorem. In addition to its profound significance in commutative algebra and algebraic…

Logic · Mathematics 2024-06-04 Dhruv Kulshreshtha

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena
‹ Prev 1 8 9 10 Next ›