Related papers: Direction-Critical Configurations in Noncentral Ge…

In this article we prove the topological minimality of unions of several almost orthogonal planes of arbitrary dimensions. A particular case was proved in arXiv:1103.1468, where we proved the Almgren minimality (which is a weaker property…

A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \gg \frac{\log n}{n}$, the random graph $G(n,p)$ is…

Let $X$ be a nonelementary CAT(0) cubical complex. We prove that if $X$ is essential and irreducible, then the contact graph of $X$ (introduced in \cite{Hagen}) is unbounded and its boundary is homeomorphic to the regular boundary of $X$…

A subset $S$ of vertices of a graph $G$ is in \emph{general position} if no shortest path in $G$ contains three vertices of $S$. The \emph{general position problem} consists of finding the number of vertices in a largest general position…

A well-known result from Brouwer states that any orientation preserving homeomorphism of the plane with no fixed points has an empty non-wandering set. In particular, an invariant compact set implies the existence of a fixed point. In this…

In this paper we show that there exists a family of domains $\Omega_{\varepsilon}\subseteq\mathbb{R}^N$ with $N\ge2$, such that the $stable$ solution of the problem \[ \begin{cases} -\Delta u= g(u)&\hbox{in }\Omega_\varepsilon\\…

Let $S$ be a set of $n$ points in the plane in general position. Two line segments connecting pairs of points of $S$ cross if they have an interior point in common. Two vertex disjoint geometric graphs with vertices in $S$ cross if there…

We consider convex maps f:R^n -> R^n that are monotone (i.e., that preserve the product ordering of R^n), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the…

It has been known since 1991 that the problem of recognizing grid intersection graphs is NP-complete. Here we use a modified argument of the above result to show that even if we restrict to the class of unit grid intersection graphs…

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

We study inverse limit spaces of tent maps, and the Ingram Conjecture, which states that the inverse limit spaces of tent maps with different slopes are non-homeomorphic. When the tent map is restricted to its core, so there is no ray…

It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…

Critical points of an invariant function may or may not be symmetric. We prove, however, that if a symmetric critical point exists, those adjacent to it are generically symmetry breaking. This mathematical mechanism is shown to carry…

We study fixed points with N scalar fields in $4 - \varepsilon$ dimensions to leading order in $\varepsilon$ using a bottom-up approach. We do so by analyzing O(N) invariants of the quartic coupling $\lambda_{ijkl}$ that describes such…

We show that, for planar point sets, the number of non-crossing Hamiltonian paths is polynomially bounded in the number of non-crossing paths, and the number of non-crossing Hamiltonian cycles (polygonalizations) is polynomially bounded in…

Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…

We revisit the characterization of \emph{trivial} isochronous centers for planar polynomial Hamiltonian systems in degrees $5$ and $7$ obtained by Braun--Llibre--Mereu, and we formalize two conclusions suggested by their method. First, a…

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

We formulate and study analytically and computationally two families of piecewise linear degree one circle maps. These families offer the rare advantage of being non-trivial but essentially solvable models for the phenomenon of mode-locking…

The simplest solutions of the N-body problem --symmetric relative equilibria-- are shown to be organizing centers from which stem some recently studied classes of periodic solutions. We focus on the relative equilibrium of the equal-mass…