English
Related papers

Related papers: Simple birational extensions of the polynomial rin…

200 papers

The goal of this work is to prove an embedding theorem for compact almost complex manifolds into complex algebraic varieties. It is shown that every almost complex structure can be realized by the transverse structure to an algebraic…

Complex Variables · Mathematics 2016-07-18 Jean-Pierre Demailly , Hervé Gaussier

We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in $\Sigma_2^p$. In the case of linear matroids, which are represented over polynomially growing fields, we note that the problem is…

Computational Complexity · Computer Science 2008-11-25 Raghavendra Rao B. V. , Jayalal M. N. Sarma

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Symbolic Computation · Computer Science 2014-05-05 Danko Adrovic , Jan Verschelde

The notion of isomorphism of stable AF-C*-algebras is considered in this paper in the case when the corresponding Bratteli diagram is stationary, i.e., is associated with a single square primitive nonsingular incidence matrix.…

Operator Algebras · Mathematics 2007-05-23 Ola Bratteli , Palle E. T. Jorgensen , Ki Hang Kim , Fred Roush

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

Commutative Algebra · Mathematics 2012-10-09 Joost Berson

We restate the semistable reduction theorem from geometric invariant theory in the context of spaces of morphisms on $\mathbb{P}^{n}$. For every complete curve $C$ downstairs, we get a $\mathbb{P}^{n}$-bundle on an abstract curve $D$…

Algebraic Geometry · Mathematics 2011-06-10 Alon Levy

For a surjective self-morphism on a projective variety defined over a number field, we study the preimages question, which asks if the set of rational points on the iterated preimages of an invariant closed subscheme eventually stabilize.…

Algebraic Geometry · Mathematics 2023-11-07 Yohsuke Matsuzawa , Kaoru Sano

The classical Cauchy rigidity theorem for convex polytopes reads that if two convex polytopes have isometric developments then they are congruent. In other words, we can decide whether two polyhedra are isometric or not by using their…

Metric Geometry · Mathematics 2023-03-28 Victor Alexandrov

We propose an algebraic geometry framework for the Kakeya problem. We conjecture that for any polynomials $f,g\in\F_{q_0}[x,y]$ and any $\F_q/\F_{q_0}$, the image of the map $\F_q^3\to\F_q^3$ given by $(s,x,y)\mapsto…

Algebraic Geometry · Mathematics 2024-06-04 Kaloyan Slavov

We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…

Number Theory · Mathematics 2023-01-10 Hong Liu , Péter Pál Pach , Csaba Sándor

For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…

Algebraic Geometry · Mathematics 2008-04-02 Hani Shaker

We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows.…

Computational Geometry · Computer Science 2016-08-26 Radoslav Fulek

The note is devoted to multiple mixing, spectrum, rank and self-joinings of measure-preserving transformations. We recall famous open problems, discuss related questions and some known results. A hypothetical example of an automorphism of…

Dynamical Systems · Mathematics 2024-05-07 Valery V. Ryzhikov

The moduli space of planar polygons with generic side lengths is a closed, smooth manifold. Mapping a polygon to its reflected image across the $X$-axis defines a fixed-point-free involution on these moduli spaces, making them into free…

Algebraic Topology · Mathematics 2022-07-25 Navnath Daundkar , Priyavrat Deshpande , Shuchita Goyal , Anurag Singh

Given a polynomial endomorphism F of the n-dimensional affine space over a field K, we define a sequence of polynomial endomorphisms of the affine space associated to F. We call F nice if there exists an integer m such that the m-th term of…

Algebraic Geometry · Mathematics 2016-01-07 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

Let $C$ be an affine curve over an algebraically closed field $k$ of characteristic $p>0$. Given an embedding problem $(\beta:\Gamma\longrightarrow G, \alpha: \pi^{et}_1(C)\longrightarrow G)$ for $\pi_1^{et}(C)$ where $\beta$ is a…

Algebraic Geometry · Mathematics 2024-03-07 Manish Kumar , Poulami Mandal

We discuss a simple example of an F-theory compactification on a Calabi-Yau fourfold where background fluxes, together with nonperturbative effects from Euclidean D3 instantons and gauge dynamics on D7 branes, allow us to fix all closed and…

High Energy Physics - Theory · Physics 2008-11-26 Frederik Denef , Michael R. Douglas , Bogdan Florea , Antonella Grassi , Shamit Kachru

Given $p$ polynomials with coefficients in a commutative unitary integral ring $\mathcal{C}$ containing $\mathbb{Q}$, we define the notion of a generic Bernstein-Sato polynomial on an irreducible affine scheme $V \subset…

Algebraic Geometry · Mathematics 2007-05-23 Rouchdi Bahloul

We prove a new Elekes-Szab\'o type estimate on the size of the intersection of a Cartesian product $A\times B\times C$ with an algebraic surface $\{f=0\}$ over the reals. In particular, if $A,B,C$ are sets of $N$ real numbers and $f$ is a…

Combinatorics · Mathematics 2024-02-27 Jozsef Solymosi , Joshua Zahl

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

General Mathematics · Mathematics 2007-05-23 Aleksandr Golubchik