Epimorphic images of the [5,3,5] Coxeter group

We classify the normal subgroups of the Coxeter group $\varGamma =[5,3,5]$ , and of its even subgroup $\varGamma ^+$ , with quotient isomorphic to a finite simple group $L_2(q)$ . There are infinitely many such normal subgroups of $\varGamma ^+$ , each uniformising a compact orientable hyperbolic $3$ -manifold tessellated by dodecahedra; we determine the isometry groups of these manifolds and the symmetry groups of their tessellations. By contrast there is a single such normal subgroup of $\varGamma $ , uniformising a compact non-orientable $3$ -orbifold with isometry group $PGL_2(19)$ .     

On Sets Defining Few Ordinary Lines

Let $P$ P be a set of $n$ n points in the plane, not all on a line. We show that if $n$ n is large then there are at least $n/2$ n / 2 ordinary lines, that is to say lines passing through exactly two points of $P$ P . This confirms, for large $n$ n , a conjecture of Dirac and Motzkin. In fact we describe the exact extremisers for this problem, as well as all sets having fewer than $n-C$ n - C ordinary lines for some absolute constant $C$ C . We also solve, for large $n$ n , the “orchard-planting problem”, which asks for the maximum number of lines through exactly 3 points of $P$ P . Underlying these results is a structure theorem which states that if $P$ P has at most $Kn$ K n ordinary lines then all but O(K) points of $P$ P lie on a cubic curve, if $n$ n is sufficiently large depending on $K$ K .     

On matching cover of graphs

A k-matching cover of a graph \(G\) is a union of \(k\) matchings of \(G\) which covers \(V(G)\) . The matching cover number of \(G\) , denoted by \(mc(G)\) , is the minimum number \(k\) such that \(G\) has a \(k\) -matching cover. A matching cover of \(G\) is optimal if it consists of \(mc(G)\) matchings of \(G\) . In this paper, we present an algorithm for finding an optimal matching cover of a graph on \(n\) vertices in \(O(n^3)\) time (if use a faster maximum matching algorithm, the time complexity can be reduced to \(O(nm)\) , where \(m=|E(G)|\) ), and give an upper bound on matching cover number of graphs. In particular, for trees, a linear-time algorithm is given, and as a by-product, the matching cover number of trees is determined.     

Categorical group invariants of 3-manifolds

For a given class \({\mathcal{G}}\) of groups, a 3-manifold M is of \({\mathcal{G}}\) -category \({\leq k}\) if it can be covered by k open subsets such that for each path-component W of the subsets the image of its fundamental group \({ \pi_1(W) \rightarrow \pi(M )}\) belongs to \({\mathcal{G}}\) . The smallest number k such that M admits such a covering is the \({\mathcal{G}}\) -category, \({cat_{\mathcal{G}}(M)}\) . If M is closed, it has \({\mathcal{G}}\) -category between 1 and 4. We characterize all closed 3-manifolds of \({\mathcal{G}}\) -category 1, 2, and 3 for various classes \({\mathcal{G}}\) .     

Characterization of Co-blockers for Simple Perfect Matchings in a Convex Geometric Graph

Consider the complete convex geometric graph on $2m$ 2 m vertices, CGG $(2m)$ ( 2 m ) , i.e., the set of all boundary edges and diagonals of a planar convex $2m$ 2 m -gon P. In (Keller and Perles, Israel J Math 187:465–484, 2012), the smallest sets of edges that meet all the simple perfect matchings (SPMs) in CGG $(2m)$ ( 2 m ) (called “blockers”) are characterized, and it is shown that all these sets are caterpillar graphs with a special structure, and that their total number is $m \cdot 2^{m-1}$ m · 2 m ? 1 . In this paper we characterize the co-blockers for SPMs in CGG $(2m)$ ( 2 m ) , that is, the smallest sets of edges that meet all the blockers. We show that the co-blockers are exactly those perfect matchings M in CGG $(2m)$ ( 2 m ) where all edges are of odd order, and two edges of M that emanate from two adjacent vertices of P never cross. In particular, while the number of SPMs and the number of blockers grow exponentially with m, the number of co-blockers grows super-exponentially.     

*-Quantizations of Fourier–Mukai Transforms

We study deformations of Fourier–Mukai transforms in general complex analytic settings. Suppose X and Y are complex manifolds, and let P be a coherent sheaf on X ×  Y. Suppose that the Fourier–Mukai transform ${\Phi}$ Φ given by the kernel P is an equivalence between the coherent derived categories of X and of Y. Suppose also that we are given a formal *-quantization ${\mathbb{X}}$ X of X. Our main result is that ${\mathbb{X}}$ X gives rise to a unique formal *-quantization ${\mathbb{Y}}$ Y of Y. For the statement to hold, *-quantizations must be understood in the framework of stacks of algebroids. The quantization ${\mathbb{Y}}$ Y is uniquely determined by the condition that ${\Phi}$ Φ deforms to an equivalence between the derived categories of ${\mathbb{X}}$ X and ${\mathbb{Y}}$ Y . Equivalently, the condition is that P deforms to a coherent sheaf ${\tilde{P}}$ P ~ on the formal *-quantization ${\mathbb{X} \times\mathbb{Y}^{op}}$ X × Y o p of X × Y; here ${\mathbb{Y}^{op}}$ Y o p is the opposite of the quantization ${\mathbb{Y}}$ Y .     

Estimating the Minimal Number of Colors in Acyclic $$k $$ -Strong Colorings of Maps on Surfaces

A coloring of the vertices of a graph is called acyclic if the ends of each edge are colored in distinct colors, and there are no two-colored cycles. Suppose each face of rank $k$ , $k \geqslant 4$ , in a map on a surface $S^N $ is replaced by the clique having the same number of vertices. It is proved in [1] that the resulting pseudograph admits an acyclic coloring with the number of colors depending linearly on N and $k$ . In the present paper we prove a sharper estimate $55( - Nk)^{4/7} $ for the number of colors provided that $k \geqslant 1$ and $ - N \geqslant 5^7 k^{4/3} $ .     

On generalizing transitivity, persistence, and sensitivity

A subgroup property $\alpha $ is transitive in a group $G$ if $U \alpha V$ and $V \alpha G$ imply that $U \alpha G$ whenever $U \le V \le G$ , and $\alpha $ is persistent in $G$ if $U \alpha G$ implies that $U \alpha V$ whenever $U \le V \le G$ . Even though a subgroup property $\alpha $ may be neither transitive nor persistent, a given subgroup $U$ may have the property that each $\alpha $ -subgroup of $U$ is an $\alpha $ -subgroup of $G$ , or that each $\alpha $ -subgroup of $G$ in $U$ is an $\alpha $ -subgroup of $U$ . We call these subgroup properties $\alpha $ -transitivity and $\alpha $ -persistence, respectively. We introduce and develop the notions of $\alpha $ -transitivity and $\alpha $ -persistence, and we establish how the former property is related to $\alpha $ -sensitivity. In order to demonstrate how these concepts can be used, we apply the results to the cases in which $\alpha $ is replaced with “normal” and the “cover-avoidance property.” We also suggest ways in which the theory can be developed further.     

Sporadic Reinhardt Polygons

Let $n$ be a positive integer, not a power of two. A Reinhardt polygon is a convex $n$ -gon that is optimal in three different geometric optimization problems: it has maximal perimeter relative to its diameter, maximal width relative to its diameter, and maximal width relative to its perimeter. For almost all $n$ , there are many Reinhardt polygons with $n$ sides, and many of them exhibit a particular periodic structure. While these periodic polygons are well understood, for certain values of $n$ , additional Reinhardt polygons exist, which do not possess this structured form. We call these polygons sporadic. We completely characterize the integers $n$ for which sporadic Reinhardt polygons exist, showing that these polygons occur precisely when $n=pqr$ with $p$ and $q$ distinct odd primes and $r\ge 2$ . We also prove that a positive proportion of the Reinhardt polygons with $n$ sides is sporadic for almost all integers $n$ , and we investigate the precise number of sporadic Reinhardt polygons that are produced for several values of $n$ by a construction that we introduce.     

Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order

For a graph G and a set \({\mathcal{F}}\) of connected graphs, G is said be \({\mathcal{F}}\) -free if G does not contain any member of \({\mathcal{F}}\) as an induced subgraph. We let \({\mathcal{G} _{3}(\mathcal{F})}\) denote the set of all 3-connected \({\mathcal{F}}\) -free graphs. This paper is concerned with sets \({\mathcal{F}}\) of connected graphs such that \({\mathcal{F}}\) contains no star, \({|\mathcal{F}|=3}\) and \({\mathcal{G}_{3}(\mathcal{F})}\) is finite. Among other results, we show that for a connected graph T( ≠ K ₁) which is not a star, \({\mathcal{G}_{3}(\{K_{4},K_{2,2},T\})}\) is finite if and only if T is a path of order at most 6.     

Computable representations for convex hulls of low-dimensional quadratic forms

Let ${\mathcal{C}}$ be the convex hull of points ${{\{{1 \choose x}{1 \choose x}^T \,|\, x\in \mathcal{F}\subset \Re^n\}}}$ . Representing or approximating ${\mathcal{C}}$ is a fundamental problem for global optimization algorithms based on convex relaxations of products of variables. We show that if n ≤ 4 and ${\mathcal{F}}$ is a simplex, then ${\mathcal{C}}$ has a computable representation in terms of matrices X that are doubly nonnegative (positive semidefinite and componentwise nonnegative). We also prove that if n = 2 and ${\mathcal{F}}$ is a box, then ${\mathcal{C}}$ has a representation that combines semidefiniteness with constraints on product terms obtained from the reformulation-linearization technique (RLT). The simplex result generalizes known representations for the convex hull of ${{\{(x_1, x_2, x_1x_2)\,|\, x\in\mathcal{F}\}}}$ when ${\mathcal{F}\subset\Re^2}$ is a triangle, while the result for box constraints generalizes the well-known fact that in this case the RLT constraints generate the convex hull of ${{\{(x_1, x_2, x_1x_2)\,|\, x\in\mathcal{F}\}}}$ . When n = 3 and ${\mathcal{F}}$ is a box, we show that a representation for ${\mathcal{C}}$ can be obtained by utilizing the simplex result for n = 4 in conjunction with a triangulation of the 3-cube.     

Special values of anticyclotomic L-functions modulo λ

The purpose of this article is to generalize some results of Vatsal on the special values of Rankin–Selberg L-functions in an anticyclotomic \({\mathbb{Z}_{p}}\) -extension. Let g be a cuspidal Hilbert modular newform of parallel weight \({(2,\ldots,2)}\) and level \({\mathcal{N}}\) over a totally real field F, and let K/F be a totally imaginary quadratic extension of relative discriminant \({\mathcal{D}}\) . We study the l-adic valuation of the special values \({L(g,\chi,\frac{1}{2})}\) as \({\chi}\) varies over the ring class characters of K of \({\mathcal{P}}\) -power conductor, for some fixed prime ideal \({\mathcal{P}}\) . We prove our results under the only assumption that the prime to \({\mathcal{P}}\) part of \({\mathcal{N}}\) is relatively prime to \({\mathcal{D}}\) .     

Prescribed diagonal Schouten tensor in locally conformally flat manifolds

We consider the pseudo-euclidean space ${(\mathbb{R}^n, g)}$ , with n ≥  3 and ${g_{ij} = \delta_{ij} \varepsilon_i, \varepsilon_i = \pm 1}$ and tensors of the form ${T = \sum \nolimits_i \varepsilon_i f_i (x) dx_i^2}$ . In this paper, we obtain necessary and sufficient conditions for a diagonal tensor to admit a metric ${\bar{g}}$ , conformal to g, so that ${A_{\bar g}=T}$ , where ${A_{\bar g}}$ is the Schouten Tensor of the metric ${\bar g}$ . The solution to this problem is given explicitly for special cases for the tensor T, including a case where the metric ${\bar g}$ is complete on ${\mathbb{R}^n}$ . Similar problems are considered for locally conformally flat manifolds. As an application of these results we consider the problem of finding metrics ${\bar g}$ , conformal to g, such that ${\sigma_2 ({\bar g })}$ or ${\frac{\sigma_2 ({\bar g })}{\sigma_1 ({\bar g })}}$ is equal to a given function. We prove that for some functions, f ₁ and f ₂, there exist complete metrics ${\bar{g} = g/{\varphi^2}}$ , such that ${\sigma_2 ({\bar g }) = f_1}$ or ${\frac{\sigma_2 ({\bar g })}{\sigma_1 ({\bar g })} = f_2}$ .     

\mathfrak{E} of topological spaces II

In this paper, we obtain analogues, in the situation of \(\mathfrak{E}\) -extensions, of Magill's theorem on lattices of compactifications. We define an epireflective subcategory of the categoryT 2 of all Hausdorff spaces to be admissive (respectively finitely admissive) if for any \(\mathfrak{E}\) -regular spaceX, every Hausdorff quotient of \(\beta _\mathfrak{E} X\) which is Urysohn on \(\beta _\mathfrak{E} X - X\) (respectively which is finitary on \(\beta _\mathfrak{E} X - X\) ) and which is identity onX, has \(\mathfrak{E}\) . We notice that there are many proper epireflective subcategories ofT 2 containing all compact spaces and which are admissive; there are many such which are not admissive but finitely admissive. We prove that when \(\mathfrak{E}\) is a finitely admissive epireflective subcategory ofT 2, then the lattices of finitary \(\mathfrak{E}\) -extensions of two spacesX andY are isomorphic if and only if \(\beta _\mathfrak{E} X - X\) and \(\beta _\mathfrak{E} Y - Y\) are homeomorphic. Further if \(\mathfrak{E}\) is admissive, then the lattices of Urysohn \(\mathfrak{E}\) -extensions ofX andY are isomorphic if and only if \(\beta _\mathfrak{E} X - X\) and \(\beta _\mathfrak{E} Y - Y\) are homeomorphic.     

Local Definitizability of {{T^{[\ast]}T}} and {{TT^{{[\ast]}}}}

The spectral properties of two products AB and BA of possibly unbounded operators A and B in a Banach space are considered. The results are applied in the comparison of local spectral properties of the operators ${T^{[\ast]} T}$ and ${TT^{[\ast]}}$ in a Krein space. It is shown that under the assumption that both operators ${T^{[\ast]} T}$ and ${TT^{[\ast]}}$ have non-empty resolvent sets, the operator ${T^{[\ast]} T}$ is locally definitizable if and only if ${TT^{[\ast]}}$ is. In this context the critical points of both operators are compared.     

Approximating Tverberg Points in Linear Time for Any Fixed Dimension

Let $P \subseteq \mathbb{R }^d$ P ? R d be a $d$ d -dimensional $n$ n -point set. A Tverberg partition is a partition of $P$ P into $r$ r sets $P_1, \dots , P_r$ P 1 , ? , P r such that the convex hulls $\hbox {conv}(P_1), \dots , \hbox {conv}(P_r)$ conv ( P 1 ) , ? , conv ( P r ) have non-empty intersection. A point in $\bigcap _{i=1}^{r} \hbox {conv}(P_i)$ ? i = 1 r conv ( P i ) is called a Tverberg point of depth $r$ r for $P$ P . A classic result by Tverberg shows that there always exists a Tverberg partition of size $\lceil n/(d+1) \rceil $ ? n / ( d + 1 ) ? , but it is not known how to find such a partition in polynomial time. Therefore, approximate solutions are of interest. We describe a deterministic algorithm that finds a Tverberg partition of size $\lceil n/4(d+1)^3 \rceil $ ? n / 4 ( d + 1 ) 3 ? in time $d^{O(\log d)} n$ d O ( log d ) n . This means that for every fixed dimension we can compute an approximate Tverberg point (and hence also an approximate centerpoint) in linear time. Our algorithm is obtained by combining a novel lifting approach with a recent result by Miller and Sheehy (Comput Geom Theory Appl 43(8):647–654, 2010).     

Separable forms of {{\mathbb{G}}_m} -ACTIONS ON {{\mathbb{A}}^3}

Let k be a field of characteristic zero. We consider k-forms of $ {\mathbb G} $ _m -actions on $ {\mathbb A} $ ³ and show that they are linearizable. In particular, $ {\mathbb G} $ _m -actions on $ {\mathbb A} $ ³ are linearizable, and k-forms of $ {\mathbb A} $ ³ that admit an effective action of an infinite reductive group are trivial.     

Supports of (\mathfrak{g},\mathfrak{k})-modules of finite type

Let $\mathfrak{g}$ be a semisimple Lie algebra and $\mathfrak{k}$ be a reductive subalgebra in $\mathfrak{g}$ . We say that a $\mathfrak{g}$ -module M is a $(\mathfrak{g},\mathfrak{k})$ -module if M, considered as a $\mathfrak{k}$ -module, is a direct sum of finite-dimensional $\mathfrak{k}$ -modules. We say that a $(\mathfrak{g},\mathfrak{k})$ -module M is of finite type if all $\mathfrak{k}$ -isotopic components of M are finite-dimensional. In this paper we prove that any simple $(\mathfrak{g},\mathfrak{k})$ -module of finite type is holonomic. A simple $\mathfrak{g}$ -module M is associated with the invariants V(M), V(LocM), and L(M) reflecting the ??directions of growth of M.?? We also prove that for a given pair $(\mathfrak{g},\mathfrak{k})$ the set of possible invariants is finite.     

The Degree of Weakly Discretely Generated Spaces

A space X is discretely generated at a point \({x \in X}\) if for any \({A \subseteqq X}\) with \({x \in \textsf{cl}(A)}\) , there exists a discrete set \({D \subseteqq A}\) such that \({x \in \textsf{cl}(D)}\) . The space X is discretely generated if it is discretely generated at every point \({x \in X}\) . We say that X is weakly discretely generated if for any non-closed set \({A \subseteqq X}\) , there exists a discrete set \({D \subseteqq A}\) such that \({\textsf{cl}(D) \setminus A \neq \emptyset}\) . New results about these properties in the classes of pseudocompact and ?ech-complete spaces are obtained and a theorem of Ivanov and Osipov concerning the ordinal function idc is generalized to the class of ?ech-complete spaces.