Related papers: Self-affinity of discs under glass-cut dissections

We observe that, for each positive integer n > 2, each of the Artin groups of finite type A_n, B_n=C_n, and affine type \tilde A_{n-1} and \tilde C_{n-1} is a central extension of a finite index subgroup of the mapping class group of the…

The automorphisms of the symmetrized polydisc $\mathbb G_n$ are well-known and are given in the coordinates of the polydisc in \cite{E:Z}. We find an explicit formula for the automorphisms of $\mathbb G_n$ in its own coordinates. If $\tau$…

A triangle decomposition of a graph $G$ is a partition of the edges of $G$ into triangles. Two necessary conditions for $G$ to admit such a decomposition are that $|E(G)|$ is a multiple of three and that the degree of any vertex in $G$ is…

An automorphism of a graph $G=(V,E)$ is a bijective map $\phi$ from $V$ to itself such that $\phi(v_i)\phi(v_j)\in E$ $\Leftrightarrow$ $v_i v_j\in E$ for any two vertices $v_i$ and $v_j$. Denote by $\mathfrak{G}$ the group consisting of…

Let $\mathrm{pod}_{-4}(n)$ denote the number of partition quadruples of $n$ where the odd parts in each partition are distinct. We find many arithmetic properties of $\mathrm{pod}_{-4}(n)$ involving the following infinite family of…

Let $A$ be an expanding integer matrix with characteristic polynomial $f(x)=x^{2}+px+q$, and let $\mathcal{D}=\{0,1,\dots,|q|-2,|q|+m\}\mathbf{v}$ be a collinear digit set where $m\geqslant 0, {\mathbf v}\in {\mathbb Z}^2$. It is well known…

A connected graph is called fragile if it contains an independent vertex cut. In 2002 Chen and Yu proved that every connected graph of order $n$ and size at most $2n-4$ is fragile, and in 2013 Le and Pfender characterized the non-fragile…

The positive discrepancy of a graph $G$ of edge density $p=e(G)/\binom{v(G)}{2}$ is defined as $$\mbox{disc}^{+}(G)=\max_{U\subset V(G)}e(G[U])-p\binom{|U|}{2}.$$ In 1993, Alon proved (using the equivalent terminology of minimum bisections)…

Every triangle-free planar graph on n vertices has an independent set of size at least (n+1)/3, and this lower bound is tight. We give an algorithm that, given a triangle-free planar graph G on n vertices and an integer k>=0, decides…

For a family $\mathcal{C}$ of properly embedded curves in the 2-dimensional disk $\mathbb{D}^{2}$ satisfying certain uniqueness properties, we consider convex polygons $P\subset \mathbb{D}^{2}$ and define a metric $d$ on $P$ such that…

We generalize the usual relationship between irreducible Zariski closed subsets of the affine space, their defining ideals, coordinate rings, and function fields, to a non-commutative setting, where "varieties" carry a PGL_n-action, regular…

We give a complete characterisation of the cubic graphs with no eigenvalues in the interval $(-2,0)$. There is one thin infinite family consisting of a single graph on $6n$ vertices for each $n \geqslant 2$, and five ``sporadic'' graphs,…

In this paper, we study closed four-dimensional manifolds. In particular, we show that under various new pinching curvature conditions (for example, the sectional curvature is no more than 5/6 of the smallest Ricci eigenvalue) then the…

We prove that for every complete multipartite graph $F$ there exist very dense graphs $G_n$ on $n$ vertices, namely with as many as ${n\choose 2}-cn$ edges for all $n$, for some constant $c=c(F)$, such that $G_n$ can be decomposed into…

A plane near-triangulation G can be decomposed into a collection of induced subgraphs, described here as the W-components of G, such that G is perfect (respectively, chordal) if and only if each of its W-components is perfect (respectively,…

Given a polynomial endomorphism F of the n-dimensional affine space over a field K, we define a sequence of polynomial endomorphisms of the affine space associated to F. We call F nice if there exists an integer m such that the m-th term of…

We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an…

There is a long standing conjecture in Hamiltonian analysis which claims that there exist at least $n$ geometrically distinct closed characteristics on every compact convex hypersurface in $\R^{2n}$ with $n\ge 2$. Besides many partial…

The notion of $1$-affineness was originally formulated by Gaitsgory in the context of derived algebraic geometry. Motivated by applications to rigid and analytic geometry, we introduce two very general and abstract frameworks where it makes…

A compact set $E\subset {\Bbb R}^d$ is said to be arithmetically thick if there exists a positive integer $n$ so that the $n$-fold arithmetic sum of $E$ has non-empty interior. We prove the arithmetic thickness of $E$, if $E$ is uniformly…