English
Related papers

Related papers: Real Polynomial Rings and Domain Invariance

200 papers

The inverse theory for Gowers uniformity norms is one of the central topics in additive combinatorics and one of the most important aspects of the theory is the question of bounds. In this paper, we prove a quasipolynomial inverse theorem…

Combinatorics · Mathematics 2024-10-28 Luka Milićević

Thanks to a connection between two completely different topics, the classical eigenvalue problem in a finite dimensional real vector space and the Brouwer degree for maps between oriented differentiable real manifolds, we were able to…

Spectral Theory · Mathematics 2019-12-09 Pierluigi Benevieri , Alessandro Calamai , Massimo Furi , Maria Patrizia Pera

A matrix formalism is proposed for computations based on Picard--Lefschetz theory in a 2D case. The formalism is essentially equivalent to the computation of the intersection indices necessary for the Picard--Lefschetz formula and enables…

Mathematical Physics · Physics 2025-12-22 A. V. Shanin , A. I. Korolkov , N. M. Artemov , R. C. Assier

A continuous complex-valued function $F$ in a domain $D\subseteq\mathbf{C}$ is Poly-analytic of order $\alpha$ if it satisfies $\partial^{\alpha}_{\overline{z}}F=0.$ One can show that $F$ has the form…

Complex Variables · Mathematics 2020-02-27 Zayid Abdulhadi , Layan El Hajj

We prove an effective version of the inverse theorem for the Gowers $U^3$-norm for functions supported on high-rank quadratic level sets in finite vector spaces. For configurations controlled by the $U^3$-norm (complexity-two…

Combinatorics · Mathematics 2024-09-13 Sean Prendiville

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

Number Theory · Mathematics 2014-09-29 Matthew Tointon

We provide algorithmic versions of the Polynomial Freiman-Ruzsa theorem of Gowers, Green, Manners, and Tao (Ann. of Math., 2025). In particular, we give a polynomial-time algorithm that, given a set $A \subseteq \mathbb{F}_2^n$ with…

Combinatorics · Mathematics 2026-04-07 Davi Castro-Silva , Jop Briët , Srinivasan Arunachalam , Arkopal Dutt , Tom Gur

In this paper, a notion of affine walled Brauer-Clifford superalgebras $BC_{r, t}^{\rm aff} $ is introduced over an arbitrary integral domain $R$ containing $2^{-1}$. These superalgebras can be considered as affinization of walled Brauer…

Quantum Algebra · Mathematics 2017-08-18 Mengmeng Gao , Hebing Rui , Linliang Song , Yucai Su

For every Brouwer (ie planar, fixed point free, orientation preserving) homeomorphism h there exists a covering of the plane by translation domains, invariant simply-connected open subsets on which h is conjugate to an affine translation.…

Dynamical Systems · Mathematics 2014-11-11 Frederic Le Roux

In this paper, we consider real and complex algebras as well as algebras over general fields. In Section 2, we revisit and prove several results on (quadratic) algebras over general fields. As an example, we demonstrate that a quadratic…

Rings and Algebras · Mathematics 2025-03-28 Bamdad R. Yahaghi

In this paper we present a proof of Hartogs' extension theorem, following T. Sobieszek's paper from 2003. Hartogs' theorem provides a large class of domains where holomorphic functions have analytic continuation to larger domains, and is "a…

Complex Variables · Mathematics 2016-08-03 Aleksander Simonič

The Casas-Alvero conjecture states that if $f(X)$ is a monic univariate polynomial of degree $d$ over a characteristic $0$ field $\mathbb{K}$ such that $\gcd(f, f_{i})$ is non-trivial for each $i=1, \dots, d-1$, then $f(X)=(X-\alpha)^d$ for…

Commutative Algebra · Mathematics 2026-03-24 Soham Ghosh

Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…

Computational Complexity · Computer Science 2025-10-28 Markus Bläser , Sagnik Dutta , Gorav Jindal

We give a new proof of Cartan's fixed point theorem using topological fixed point theory. For an odd dimensional, simply connected and complete manifold having non-positive curvature, we further prove that every isometry with finite order…

Differential Geometry · Mathematics 2023-04-20 Chaitanya Ambi

In this paper we obtain new quantitative forms of Hilbert's Irreducibility Theorem. In particular, we show that if $f(X, T_1, \ldots, T_s)$ is an irreducible polynomial with integer coefficients, having Galois group $G$ over the function…

Number Theory · Mathematics 2016-02-02 Abel Castillo , Rainer Dietmann

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

Numerical Analysis · Mathematics 2014-07-01 Victor Y. Pan

This paper aims at studying how finitely many generalized polarization tensors of an algebraic domain can be used to determine its shape. Precisely, given a planar set with real algebraic boundary, it is shown that the minimal polynomial…

Analysis of PDEs · Mathematics 2018-07-03 Habib Ammari , Mihai Putinar , Andries Steenkamp , Faouzi Triki

We realize (via an explicit isomorphism) the walled Brauer algebra for an arbitrary integral parameter delta as an idempotent truncation of a level two cyclotomic degenerate affine walled Brauer algebra. The latter arises naturally in Lie…

Representation Theory · Mathematics 2015-06-18 Antonio Sartori , Catharina Stroppel

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$ one has $$\log\left[\mathrm{lcm}(f(1),f(2),\ldots f(N))\right]\sim(d-1)N\log N$$ as $N \to \infty$. He proved it in the case $d=2$ but it…

Number Theory · Mathematics 2025-01-07 Alexei Entin , Sean Landsberg

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…

Commutative Algebra · Mathematics 2026-05-19 Olav Geil
‹ Prev 1 3 4 5 6 7 10 Next ›