Related papers: Free resolutions for multiple point spaces

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

We construct all codimension 1 multi-germs of maps (k^n,T)-->(k^p,0) with n > p-2, (n,p) nice dimensions, k = R or C, by augmentation and concetenation operations, starting from mon-germs (|T|=1). As an application, we prove general results…

Recently Sober\'on proved a far-reaching generalization of the colorful KKM Theorem due to Gale: let $n\geq k$, and assume that a family of closed sets $(A^i_j\mid i\in [n], j\in [k])$ has the property that for every $I\in…

We present a complete set of criteria for determining A-types of plane-to-plane map-germs of corank one with A-codimension <7, which provides a new insight into the A-classification theory from the viewpoint of recognition problem. As an…

For any given natural $d\ge 1$ we provide examples of rational self-maps of complex projective plane $\pp^2$ of degree $d$ without (holomorphic) fixed points. This makes a contrast with the situation in one dimension. We also prove that the…

Let $M$ be a complete K\"{a}hler manifold, whose universal covering is biholomorphic to a ball $\mathbb B^m(R_0)$ in $\mathbb C^m$ ($0<R_0\le +\infty$). In this article, we will show that if three meromorphic mappings $f^1,f^2,f^3$ of $M$…

We complete Dyson's dream by cementing the links between symmetric spaces and classical random matrix ensembles. Previous work has focused on a one-to-one correspondence between symmetric spaces and many but not all of the classical random…

Correspondences between k-tuples of points are key in multiple view geometry and motion analysis. Regular transformations are posed by homographies between two projective planes that serves as structural models for images. Such…

We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of…

In this note we give an algorithm to determine the rational homotopy type of the free and pointed mapping spaces $ map(F(\mathbb R^m,k), S^n)$ and $ map^*(F(\mathbb R^m,k), S^n)$. An explicit description of these spaces is given for $k=3$.…

We are given k points (events) in (n+1)-dimensional Minkowski space. Using the theory of hyperplane arrangments and chromatic polynomials, we obtain information the number of different orders in which the events can occur in different…

In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…

If f maps a discrete d-manifold G onto a (k+1)-partite complex P then H(G,f,P),the set of simplices x in G such that f(x) contains at least one facet in P defines a (d-k)-manifold.

Motivated by topological Tverberg-type problems and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into R^d without triple, quadruple, or, more…

We derive a formula for the number of pre-images under a non-degenerate harmonic mapping $f$, using the argument principle. This formula reveals a connection between the pre-images and the caustics. Our results allow to deduce the number of…

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

We establish a fixed-point theorem for the face maps that consist in deleting the $i$th entry of an ordered set. Furthermore, we show that there exists random finite sets of integers that are almost invariant under such deletions.…

The classification of map-germs up to the natural right-left equivalence (also known as A-equivalence) is often complicated. Certainly it is more complicated than K-equivalence which is extremely easy to work with because the associated…

The $k$-Means clustering problem on $n$ points is NP-Hard for any dimension $d\ge 2$, however, for the 1D case there exists exact polynomial time algorithms. Previous literature reported an $O(kn^2)$ time dynamic programming algorithm that…

Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…