English
Related papers

Related papers: Gauss-Prym maps on Enriques surfaces

200 papers

We consider the extrinsic geometry of surfaces in simply isotropic space, a three-dimensional space equipped with a rank 2 metric of index zero. Since the metric is degenerate, a surface normal cannot be unequivocally defined based on…

Differential Geometry · Mathematics 2020-11-13 Alev Kelleci , Luiz C. B. da Silva

Let $G$ be a graph with $n$ non-isolated vertices and $m$ edges. The positive / negative square energies of $G$, denoted $s^+(G)$ / $s^-(G)$, are defined as the sum of squares of the positive / negative eigenvalues of the adjacency matrix…

Combinatorics · Mathematics 2024-09-27 Shengtong Zhang

The skewness of a graph G is the minimum number of edges in G whose removal results in a planar graph. By appropriately introducing a weight to each edge of a graph, we determine, among other thing, the skewness of the generalized Petersen…

Combinatorics · Mathematics 2017-09-20 Gek L. Chia , Chan L. Lee , Yan Hao Ling

Given $s \ge k\ge 3$, let $h^{(k)}(s)$ be the minimum $t$ such that there exist arbitrarily large $k$-uniform hypergraphs $H$ whose independence number is at most polylogarithmic in the number of vertices and in which every $s$ vertices…

Combinatorics · Mathematics 2020-05-13 Dhruv Mubayi , Alexander Razborov

Given a rational variety $V$ defined over $K$, we consider a principally polarized abelian variety $A$ of dimension $g$ defined over $V$. For each prime l we then consider the galois representation on the $l$-torsion of $A_t$, where $t$ is…

Number Theory · Mathematics 2017-05-17 Erik Wallace

We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and…

Metric Geometry · Mathematics 2024-01-18 Sean Dewar

An extremal graph for a given graph $H$ is a graph with maximum number of edges on fixed number of vertices without containing a copy of $H$. The $k$-th power of a path is a graph obtained from a path and joining all pair of vertices of the…

Combinatorics · Mathematics 2020-03-31 Long-Tu Yuan

Let $G=(V(G),E(G))$ be a simple connected and undirected graph with vertex set $V(G)$ and edge set $E(G)$. A set $S \subseteq V(G)$ is a $dominating$ $set$ if for each $v \in V(G)$ either $v \in S$ or $v$ is adjacent to some $w \in S$. That…

Combinatorics · Mathematics 2015-03-19 Haoli Wang , Xirong Xu , Yuansheng Yang , Guoqing Wang

We determine a necessary and sufficient condition for a polynomial over an algebraically closed field $k$ to induce a surjective map on matrix algebras $M_n(k)$ for $n \ge 2$. The criterion is given in terms of critical points and uses…

Rings and Algebras · Mathematics 2016-12-05 Shubhodip Mondal

The reflection of a three-dimensional vectorial Maxwell-Gaussian beam by a planar surface is studied. The surface is characterized by its complex reflection coefficients $r_s(\bk)$ and $r_p(\bk)$ for TE and TM electromagnetic plane waves of…

Optics · Physics 2007-11-15 Andrea Aiello , Han Woerdman

Motivated by the recent work of Algom-Kfir and Bestinva introducing the mapping class group of an infinite graph via proper homotopy equivalences, we give a necessary and sufficient condition for a surface to be properly homotopy equivalent…

Geometric Topology · Mathematics 2024-10-29 Ryan Dickmann , Hannah Hoganson , Sanghoon Kwak

We prove that finding a $k$-edge induced subgraph is fixed-parameter tractable, thereby answering an open problem of Leizhen Cai. Our algorithm is based on several combinatorial observations, Gauss' famous \emph{Eureka} theorem [Andrews,…

Data Structures and Algorithms · Computer Science 2012-05-02 Bingkai Lin , Yijia Chen

We describe a general (primitively) polarized K3 surface $(S,h)$ with $(h^2)=24$ as a complete intersection variety with respect to vector bundles on the $6$-dimensional moduli space $\mathcal{N}^-$ of the stable vector bundles of rank two…

Algebraic Geometry · Mathematics 2023-10-04 Akihiro Kanemitsu , Shigeru Mukai

Using an idelic argument and assuming the Gersten conjecture for Milnor K-theory, we show that the restriction map from one-cycles on a smooth projective scheme over a henselian local ring to a pro-system of thickened zero-cycles is…

Algebraic Geometry · Mathematics 2019-10-29 Morten Lüders

A graph $G=(V,E)$ is a $k$-critical graph if $G$ is not $(k -1)$-colorable but $G-e$ is $(k-1)$-colorable for every $e\in E(G)$. In this paper, we construct a family of 4-critical planar graphs with $n$ vertices and $\frac{7n-13}{3}$ edges.…

Combinatorics · Mathematics 2015-09-03 Yao Tianxing , Zhou Guofei

We describe the "hyperbolic" properties of a riemann surface lamination M canonically associated to every compact three manifolds of curvature less than 1. More precisely, if the geodesic flow is the phase space attached to an ordinary…

Differential Geometry · Mathematics 2009-10-31 Francois Labourie

A graph of order $n$ is said to be \emph{$k$-factor-critical} ($0\leq k <n$) if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not…

Combinatorics · Mathematics 2025-11-12 Qiuli Li , Fuliang Lu , Heping Zhang

Let $\Sigma$ be a surface with boundary $b(\Sigma)$, $\mathcal{L}$ be a collection of $k$ disjoint $b(\Sigma)$-paths in $\Sigma$, and $P$ be a non-separating $b(\Sigma)$-path in $\Sigma$. We prove that there is a homeomorphism $\phi: \Sigma…

Combinatorics · Mathematics 2016-05-03 Jim Geelen , Tony Huynh , R. Bruce Richter

We construct a nonsmoothable Z\times Z-action on the connected sum of an Enriques surface and S^2\times S^2, such that each of generators is smoothable. We also construct a nonsmoothable self-homeomorphism on an Enriques surface.

Geometric Topology · Mathematics 2010-09-20 Nobuhiro Nakamura

We use methods from spectral graph theory to obtain bounds on the number of incidences between $k$-planes and $h$-planes in $\mathbb{F}_q^d$ which generalize a recent result given by Bennett, Iosevich, and Pakianathan (2014). More…

Combinatorics · Mathematics 2015-10-14 Nguyen Duy Phuong , Thang Pham , Le Anh Vinh