English
Related papers

Related papers: Parameterized stratification and piece number of D…

200 papers

We develop a dimension theory for D-semianalytic sets over an arbitrary non-Archimedean complete field. Our main results are the equivalence of several notions of dimension and a theorem on additivity of dimensions of projections and fibers…

Logic · Mathematics 2007-05-23 Y. Firat Celikler

Let K be an algebraically closed field endowed with a complete non-archimedean norm with valuation ring R. Let f:Y -> X be a map of K-affinoid varieties. In this paper we study the analytic structure of the image f(Y) in X; such an image is…

Differential Geometry · Mathematics 2016-09-07 T. S. Gardener , Hans Schoutens

Parameterized complexity seeks to use input structure to obtain faster algorithms for NP-hard problems. This has been most successful for graphs of low treewidth: Many problems admit fast algorithms relative to treewidth and many of them…

Computational Complexity · Computer Science 2022-12-20 Falko Hegerfeld , Stefan Kratsch

Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…

Algebraic Topology · Mathematics 2018-02-15 Saugata Basu , Cordian Riener

We prove three main results about semialgebraic hypergraphs. First, we prove an optimal and oblivious regularity lemma. Fox, Pach, and Suk proved that the class of $k$-uniform semialgebraic hypergraphs satisfies a very strong regularity…

Combinatorics · Mathematics 2024-11-05 Jonathan Tidor , Hung-Hsun Hans Yu

An $r$-uniform hypergraph $H$ is semi-algebraic of complexity $\mathbf{t}=(d,D,m)$ if the vertices of $H$ correspond to points in $\mathbb{R}^{d}$, and the edges of $H$ are determined by the sign-pattern of $m$ degree-$D$ polynomials.…

Combinatorics · Mathematics 2023-08-08 Zhihan Jin , István Tomon

We generalize the seminal polynomial partitioning theorems of Guth and Katz to a set of semi-Pfaffian sets. Specifically, given a set $\Gamma \subseteq \mathbb{R}^n$ of $k$-dimensional semi-Pfaffian sets, where each $\gamma \in \Gamma$ is…

Logic · Mathematics 2026-01-19 Martin Lotz , Abhiram Natarajan , Nicolai Vorobjov

Given a real analytic set X in a complex manifold and a positive integer d, denote by A(d) the set of points p in X at which there exists a germ of a complex analytic set of dimension d contained in X. It is proved that A(d) is a closed…

Complex Variables · Mathematics 2019-08-15 Janusz Adamus , Serge Randriambololona , Rasul Shafikov

Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching for integers d>2 is the problem of finding a matching of size…

Data Structures and Algorithms · Computer Science 2018-12-10 Holger Dell , Dániel Marx

Let $K$ be a real closed field with a nontrivial non-archimedean absolute value. We study a refined version of the tropicalization map, which we call real tropicalization map, that takes into account the signs on $K$. We study images of…

Algebraic Geometry · Mathematics 2020-04-29 Philipp Jell , Claus Scheiderer , Josephine Yu

A bipartite graph $G$ is semi-algebraic in $\mathbb{R}^d$ if its vertices are represented by point sets $P,Q \subset \mathbb{R}^d$ and its edges are defined as pairs of points $(p,q) \in P\times Q$ that satisfy a Boolean combination of a…

Combinatorics · Mathematics 2015-11-24 Jacob Fox , János Pach , Adam Sheffer , Andrew Suk , Joshua Zahl

In $d$-Scattered Set we are given an (edge-weighted) graph and are asked to select at least $k$ vertices, so that the distance between any pair is at least $d$, thus generalizing Independent Set. We provide upper and lower bounds on the…

Computational Complexity · Computer Science 2018-11-13 Ioannis Katsikarelis , Michael Lampis , Vangelis Th. Paschos

This paper is devoted to study multiplicity and regularity as well as to present some classifications of complex analytic sets. We present an equivalence for complex analytical sets, namely blow-spherical equivalence and we receive several…

Algebraic Geometry · Mathematics 2017-05-10 J. Edson Sampaio

We prove that coronizations with respect to arbitrary d-regular sets (not necessarily graphs) imply big pieces squared of these (approximating) sets. This is known (and due to David and Semmes in the case of sufficiently large co-dimension,…

Classical Analysis and ODEs · Mathematics 2020-09-11 Simon Bortz , John Hoffman , Steve Hofmann , José Luis Luna Garcia , Kaj Nyström

Let $K$ be an algebraically closed field endowed with a complete non-archimedean norm with valuation ring $R$. Let $f\colon Y\to X$ be a map of $K$-affinoid varieties. In this paper we study the analytic structure of the image $f(Y)\subset…

Algebraic Geometry · Mathematics 2007-05-23 T. S. Gardener , Hans Schoutens

Let $f: X \to Y$ be a dominant morphism of smooth, proper and geometrically integral varieties over a number field $k$, with geometrically integral generic fibre. We give a necessary and sufficient geometric criterion for the induced map…

Algebraic Geometry · Mathematics 2018-09-28 Daniel Loughran , Alexei N. Skorobogatov , Arne Smeets

Let $P$ be a set of $n$ points in $\R^d$. We present a linear-size data structure for answering range queries on $P$ with constant-complexity semialgebraic sets as ranges, in time close to $O(n^{1-1/d})$. It essentially matches the…

Computational Geometry · Computer Science 2015-03-20 Pankaj K. Agarwal , Jiri Matousek , Micha Sharir

For a given graph $G = (V, E)$, a subset of the vertices $D\subseteq V$ is called a semitotal dominating set, if $D$ is a dominating set and every vertex $v \in D$ is within distance two to another witness $v' \in D$. We want to find a…

Computational Complexity · Computer Science 2025-06-24 Lukas Retschmeier

The density property for a Stein manifold X implies that the group of holomorphic diffeomorphisms of X is infinite-dimensional and, in a certain well-defined sense, as large as possible. We prove that if G is a complex semisimple Lie group…

Complex Variables · Mathematics 2007-05-23 Arpad Toth , Dror Varolin

Let K be an algebraically closed field of characteristic zero, endowed with a complete nonarchimedean norm. Let X be a K-rigid analytic variety and \Sigma a semianalytic subset of X. Then the closure of \Sigma in X with respect to the…

Differential Geometry · Mathematics 2016-09-07 Hans Schoutens
‹ Prev 1 2 3 10 Next ›