English
Related papers

Related papers: Free resolutions for multiple point spaces

200 papers

The purpose of this paper has twofold. The first is to prove a unicity theorem for meromorphic mappings of a complete K\"{a}hler manifold M in P^n(C) sharing few hypersurfaces. The second is to give a unicity theorem for the case of…

Complex Variables · Mathematics 2016-10-28 Le Ngoc Quynh

For any two integers $k,n$, $2\leq k\leq n$, let $f:(\mathbb{C}^*)^n\rightarrow\mathbb{C}^k$ be a generic polynomial map with given Newton polytopes. It is known that points, whose fiber under $f$ has codimension one, form a finite set…

Algebraic Geometry · Mathematics 2020-08-07 Boulos El Hilany

Given a set $S$ of $n$ points in $\mathbb{R}^d$, a $k$-set is a subset of $k$ points of $S$ that can be strictly separated by a hyperplane from the remaining $n-k$ points. Similarly, one may consider $k$-facets, which are hyperplanes that…

Metric Geometry · Mathematics 2021-08-17 Brett Leroux , Luis Rademacher

This paper discusses the topic of dimensionality reduction for $k$-means clustering. We prove that any set of $n$ points in $d$ dimensions (rows in a matrix $A \in \RR^{n \times d}$) can be projected into $t = \Omega(k / \eps^2)$…

Artificial Intelligence · Computer Science 2011-05-05 Christos Boutsidis , Anastasios Zouzias , Petros Drineas

In this paper we consider reduction maps $r_{v} : K_{2n+1}(F)/C_{F} \to K_{2n+1}(\kappa_{v})_{l}$ where $F$ is a number field and $C_{F}$ denotes the subgroup of $K_{2n+1}(F)$ generated by $l$-parts (for all primes $l$) of kernels of the…

Number Theory · Mathematics 2016-09-07 Stefan Baranczuk

A basic problem in spectral clustering is the following. If a solution obtained from the spectral relaxation is close to an integral solution, is it possible to find this integral solution even though they might be in completely different…

Data Structures and Algorithms · Computer Science 2015-10-20 Ali Kemal Sinop

For every $k>3$, we give a construction of planar point sets with many collinear $k$-tuples and no collinear $(k+1)$-tuples. We show that there are $n_0=n_0(k)$ and $c=c(k)$ such that if $n\geq n_0$, then there exists a set of $n$ points in…

Combinatorics · Mathematics 2013-09-25 József Solymosi , Miloš Stojaković

We give a formula to count the number of $D_4$ singularities in a stable frontal perturbation of a corank $2$ wave front singularity $f\colon (\mathbb{C}^3,0) \to (\mathbb{C}^4,0)$ using Mond's method of stable perturbations of map germs.…

Algebraic Geometry · Mathematics 2025-05-13 C. Muñoz-Cabello , J. J. Nuño-Ballesteros , R. Oset Sinha

We study the dynamics of polynomial mappings f:C^k to C^k of degree at least 2 that extend continuously to projective space P^k. Our approach is to study the dynamics near the hyperplane at infinity and then making a descent to K --- the…

Dynamical Systems · Mathematics 2007-05-23 Eric Bedford , Mattias Jonsson

A new density matrix and corresponding quantum kinetic equations are introduced for fermions undergoing coherent evolution either in time (coherent particle production) or in space (quantum reflection). A central element in our derivation…

High Energy Physics - Phenomenology · Physics 2009-02-02 Matti Herranen , Kimmo Kainulainen , Pyry Matti Rahkila

Fix a number field k. We prove that if there is an algorithm for deciding whether a smooth projective geometrically integral k-variety has a k-point, then there is an algorithm for deciding whether an arbitrary k-variety has a k-point and…

Number Theory · Mathematics 2017-04-03 Bjorn Poonen

In this paper, the concepts of $K$-subset systems and $k$-well-filtered spaces are introduced, which provide another uniform approach to $d$-spaces, $s$-well-filtered spaces (i.e., $\mathcal{U}_{S}$-admissibility) and well-filtered spaces.…

General Topology · Mathematics 2023-06-22 Mengjie Jin , Qingguo Li

Let $D = d_1, d_2, \ldots, d_n$ and $F = f_1, f_2,\ldots, f_n$ be two sequences of positive integers. We consider the following decision problems: is there a $i)$ multigraph, $ii)$ loopless multigraph, $iii)$ simple graph, $iv)$ connected…

Combinatorics · Mathematics 2021-09-28 Uroš Čibej , Aaron Li , István Miklós , Sohaib Nasir , Varun Srikanth

We describe two situations where adding the adjoint divisor to a divisor D with smooth normalization yields a free divisor. Both also involve stability or versality. In the first, D is the image of a corank one stable germ of a map from…

Algebraic Geometry · Mathematics 2014-09-22 David Mond , Mathias Schulze

We compute the homology of the multiple point spaces of stable perturbations of two germs $(\mathbb{C}^n,0)\to (\mathbb{C}^{n+1},0)$ of corank 2, one with $n=3$ and one with $n=5$. We use a variety of techniques based on the image computing…

Algebraic Geometry · Mathematics 2016-10-06 David Mond

If the $\ell$-adic cohomology of a projective smooth variety, defined over a $\frak{p}$-adic field $K$ with finite residue field $k$, is supported in codimension $\ge 1$, then any model over the ring of integers of $K$ has a $k$-rational…

Number Theory · Mathematics 2007-05-23 Hélène Esnault

The order type of a point set in $R^d$ maps each $(d{+}1)$-tuple of points to its orientation (e.g., clockwise or counterclockwise in $R^2$). Two point sets $X$ and $Y$ have the same order type if there exists a mapping $f$ from $X$ to $Y$…

Computational Geometry · Computer Science 2013-11-06 Greg Aloupis , John Iacono , Stefan Langerman , Özgür Özkan

We investigate the classical and distributed complexity of \emph{$k$-partial $c$-coloring} where $c=k$, a natural generalization of Brooks' theorem where each vertex should be colored from the palette $\{1,\ldots,c\} = \{1,\ldots,k\}$ such…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-27 Jan Bok , Avinandan Das , Anna Gujgiczer , Nikola Jedličková

Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which…

Data Structures and Algorithms · Computer Science 2010-02-03 Andreas Björklund

We prove a strengthening of the trickle down theorem for partite complexes. Given a $(d+1)$-partite $d$-dimensional simplicial complex, we show that if "on average" the links of faces of co-dimension 2 are $\frac{1-\delta}{d}$-(one-sided)…

Discrete Mathematics · Computer Science 2023-06-21 Dorna Abdolazimi , Shayan Oveis Gharan