English
Related papers

Related papers: Parameterized stratification and piece number of D…

200 papers

We design new polynomial-time algorithms for recovering planted cliques in the semi-random graph model introduced by Feige and Kilian 2001. The previous best algorithms for this model succeed if the planted clique has size at least…

Data Structures and Algorithms · Computer Science 2023-06-07 Rares-Darius Buhai , Pravesh K. Kothari , David Steurer

To every closed subset $X$ of a symplectic manifold $(M,\omega)$ we associate a natural group of Hamiltonian diffeomorphisms $Ham(X,\omega)$. We equip this group with a semi-norm $\Vert\cdot\Vert^{X,\omega}$, generalizing the Hofer norm. We…

Symplectic Geometry · Mathematics 2011-02-25 Jan Swoboda , Fabian Ziltener

$H$-Packing is the problem of finding a maximum number of vertex-disjoint copies of $H$ in a given graph $G$. $H$-Partition is the special case of finding a set of vertex-disjoint copies that cover each vertex of $G$ exactly once. Our goal…

Data Structures and Algorithms · Computer Science 2025-09-09 Barış Can Esmer , Dániel Marx

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

Data Structures and Algorithms · Computer Science 2012-04-13 Vinícius G. P. de Sá , Guilherme D. da Fonseca , Raphael Machado , Celina M. H. de Figueiredo

A k-dissimilarity map on a finite set X is a function D : X \choose k \rightarrow R assigning a real value to each subset of X with cardinality k, k \geq 2. Such functions, also sometimes known as k-way dissimilarities, k-way distances, or…

Combinatorics · Mathematics 2014-12-23 Sven Herrmann , Vincent Moulton

Let X be an irreducible smooth projective curve defined over complex numbers, S= {p_1, p_2,...,p_n} \subset X$ a finite set of closed points and N > 1 a fixed integer. For any pair (r,d) in Z X Z/N, there exists a parabolic vector bundle…

Algebraic Geometry · Mathematics 2007-09-17 Indranil Biswas , Georg Hein

Let (E,D,P) be a flat vector bundle with a parabolic structure over a punctured Riemann surface, (M,g). We consider a deformation of the harmonic metric equation which we call the Poisson metric equation. This equation arises naturally as…

Differential Geometry · Mathematics 2014-04-01 Tristan C. Collins , Adam Jacob , Shing-Tung Yau

Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest $k$ such that the graph is $k$-splittable into a planar graph. A $k$-split operation…

A simply laced Dynkin diagram gives rise to a family of curves over $\mathbb{Q}$ and a coregular representation, using deformations of simple singularities and Vinberg theory respectively. Thorne has conjectured and partially proven a…

Number Theory · Mathematics 2024-06-28 Jef Laga

We lay down an elementary yet fundamental lemma concerning a finite algebraicness property of a smooth map from an Azumaya/matrix manifold with a fundamental module to a smooth manifold. This gives us a starting point to build a synthetic…

Symplectic Geometry · Mathematics 2015-04-09 Chien-Hao Liu , Shing-Tung Yau

We present a theorem of Sard type for semi-algebraic set-valued mappings whose graphs have dimension no larger than that of their range space: the inverse of such a mapping admits a single-valued analytic localization around any pair in the…

Optimization and Control · Mathematics 2015-04-30 D. Drusvyatskiy , A. D. Ioffe , A. S. Lewis

We study "distance spheres": the set of points lying at constant distance from a fixed arbitrary subset $K$ of $[0,1]^d$. We show that, away from the regions where $K$ is "too dense" and a set of small volume, we can decompose $[0,1]^d$…

Classical Analysis and ODEs · Mathematics 2021-07-21 Guy C. David , McKenna Kaczanowski , Dallas Pinkerton

In this paper, we provide evidence to support a positive answer to a question of Hassett and Tschinkel. In particular, if an algebraic variety V has a dense set of rational points, they ask whether or not the set of D-integral points is…

Algebraic Geometry · Mathematics 2018-06-11 David McKinnon , Yi Zhu

In 2015, Guth proved that if $S$ is a collection of $n$ $g$-dimensional semi-algebraic sets in $\mathbb{R}^d$ and if $D\geq 1$ is an integer, then there is a $d$-variate polynomial $P$ of degree at most $D$ so that each connected component…

Computational Geometry · Computer Science 2026-01-13 Pankaj K. Agarwal , Boris Aronov , Esther Ezra , Joshua Zahl

A new, constructive proof with a small explicit constant is given to the Erd\H{o}s-Pyber theorem which says that the edges of a graph on $n$ vertices can be partitioned into complete bipartite subgraphs so that every vertex is covered at…

Combinatorics · Mathematics 2013-11-21 László Csirmaz , Péter Ligeti , Gábor Tardos

For a bivariate $P(x,y) \in \mathbb{R}[x,y]\setminus (\mathbb{R}[x] \cup \mathbb{R}[y])$, our first result shows that for all finite $A \subseteq \mathbb{R}$, $|P(A,A)|\geq \alpha|A|^{5/4}$ with $\alpha =\alpha(\mathrm{deg} P) \in…

Logic · Mathematics 2022-12-14 Yifan Jing , Souktik Roy , Chieu-Minh Tran

Let $f:\mathbb{C}^2 \to \mathbb{C}$ be a polynomial map. Let $\mathbb{C}^2 \subset X$ be a compactification of $\mathbb{C}^2$ where $X$ is a smooth rational compact surface and such that there exists a morphism of varieties $\Phi :X\to…

Algebraic Geometry · Mathematics 2019-04-25 Pierrette Cassou-Nogues , Daniel Daigle

We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…

Combinatorics · Mathematics 2015-09-25 Tristram C. Bogart , Edward D. Kim

The symmetries of paths in a manifold $M$ are classified with respect to a given pointwise proper action of a Lie group $G$ on $M$. Here, paths are embeddings of a compact interval into $M$. There are at least two types of symmetries:…

Mathematical Physics · Physics 2015-03-24 Christian Fleischhack

We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…

Algebraic Geometry · Mathematics 2017-09-19 Claus Scheiderer
‹ Prev 1 8 9 10 Next ›