Related papers: The unavoidable arrangements of pseudocircles

We describe a straightforward construction of the pseudo-split absolutely pseudo-simple groups of minimal type with irreducible root systems of type $BC_n$; these exist only in characteristic $2$. We also give a formula for the dimensions…

For typical cocycles over subshifts of finite type, we show that for any given orbit segment, we can construct a periodic orbit such that it shadows the given orbit segment and that the product of the cocycle along its orbit is a proximal…

Singularities appear in numerous important mathematical models used in Physics. And in most of such cases singularities are involved in essentially nonlinear contexts. For more than four decades, general enough nonlinear theories of…

We describe an example of a $C^\infty$ diffeomorphism on a 7--manifold which has a compact invariant set such that uncountably many of its connected components are pseudocircles. (Any 7--manifold will suffice.) Furthermore, any…

We discuss integrable discretizations of 3-dimensional cyclic systems, that is, orthogonal coordinate systems with one family of circular coordinate lines. In particular, the underlying circle congruences are investigated in detail, and…

We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.

Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…

We determine the minimal polynomial of each element of the double cover $G$ of the symmetric or alternating group in every irreducible spin representation of $G$.

We give a short and self-contained proof of Levi's Extension Lemma for pseudoline arrangements.

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…

We establish an equivalence between infinitely many asymptotically stable periodic solutions and subsumed homoclinic connections for $N$-dimensional piecewise-linear continuous maps. These features arise as a codimension-three phenomenon.…

A cyclic subgroup graph of a group $G$ is a graph whose vertices are cyclic subgroups of $G$ and two distinct vertices $H_1$ and $H_2$ are adjacent if $H_1\leq H_2$, and there is no subgroup $K$ such that $H_1<K<H_2$. M.T\u{a}rn\u{a}uceanu…

For each nonnegative integer m we show that any closed, oriented topological four-manifold with fundamental group Z_{4m+2} and odd intersection form, with possibly seven exceptions, either admits no smooth structure or admits infinitely…

A Meyniel obstruction is an odd cycle with at least five vertices and at most one chord. A graph is Meyniel if and only if it has no Meyniel obstruction as an induced subgraph. Here we give a O(n^2) algorithm that, for any graph, finds…

We say that a loop is unbreakable when it does not have nontrivial subloops. While the cyclic groups of prime order are the only unbreakable finite groups, we show that nonassociative unbreakable loops exist for every order n >= 5. We…

We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, line multigraphs of cubic multigraphs, or are obtained from…

Simple cycles on a digraph form a trace monoid under the rule that two such cycles commute if and only if they are vertex disjoint. This rule describes the spatial configuration of simple cycles on the digraph. Cartier and Foata have showed…

A digraph is $3$-dicritical if it cannot be vertex-partitioned into two sets inducing acyclic digraphs, but each of its proper subdigraphs can. We give a human-readable proof that the number of 3-dicritical semi-complete digraphs is finite.…

An oriented link projection is the image of a generic immersion of oriented circles into the 2-sphere. The circle arrangement of a link projection is a disjoint union of unoriented circles on the 2-sphere obtained by orientation-incoherent…