English
Related papers

Related papers: Elementary elliptic $(R,q)$-polycycles

200 papers

On a real regular elliptic surface without multiple fiber, the Betti number $h_1$ and the Hodge number $h^{1,1}$ are related by $h_1\leq h^{1,1}$. We prove that it's always possible to deform such algebraic surface to obtain $h_1=h^{1,1}$.…

Algebraic Geometry · Mathematics 2025-05-23 Frédéric Mangolte

In this work, we extend the concepts of $p$-biharmonic maps and $p$-biharmonic hypersurfaces to provide a broader characterization of $(p,q)$-harmonic hypersurfaces and $(p,q)$-harmonic curves in Riemannian manifolds, including Einstein…

Differential Geometry · Mathematics 2026-03-26 Moustafa Tadj , Ahmed Mohammed Cherif , Fethi Latti

A connected $k$-uniform hypergraph with $n$ vertices and $m$ edges is called $r$-cyclic if $n=m(k-1)-r+1$. For $r=1$ or $2$, the hypergraph is simply called unicyclic or bicyclic. In this paper we investigate hypergraphs that attain larger…

Combinatorics · Mathematics 2016-07-29 Chen Ouyang , Liqun Qi , Xiying Yuan

For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…

Number Theory · Mathematics 2023-06-06 Riccardo Invernizzi , Daniele Taufer

A $3$-polytope is a $3$-connected, planar graph. It is called unigraphic if it does not share its vertex degree sequence with any other $3$-polytope, up to graph isomorphism. The classification of unigraphic $3$-polytopes appears to be a…

Combinatorics · Mathematics 2024-10-08 Riccardo W. Maffucci

For positive integers $r > \ell$, an $r$-uniform hypergraph is called an $\ell$-cycle if there exists a cyclic ordering of its vertices such that each of its edges consists of $r$ consecutive vertices, and such that every pair of…

Combinatorics · Mathematics 2019-06-13 Bhargav Narayanan , Mathias Schacht

We consider a certain mixed polynomial which is an extended Lens equation $L_{n,m}=\bar z^m-p(z)/q(z)$ with $\text{degree}\, q=n$, $\text{degree}\, p<n$ whose numerator is a mixed polynomial of degree $(n+m;n,m)$. Then we consider its…

Algebraic Geometry · Mathematics 2015-10-21 Mutsuo Oka

A Q-algebroid is a Lie superalgebroid equipped with a compatible homological vector field and is the infinitesimal object corresponding to a Q-groupoid. We associate to every Q-algebroid a double complex. As a special case, we define the…

Differential Geometry · Mathematics 2020-03-30 Rajan Amit Mehta

We prove that for any integer $k\geq 2$ and $\varepsilon>0$, there is an integer $\ell_0\geq 1$ such that any $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $(1/2+\varepsilon)n$ has a fractional decomposition into…

Combinatorics · Mathematics 2021-01-15 Felix Joos , Marcus Kühn

Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.

Combinatorics · Mathematics 2017-09-19 Ferran Hurtado , Eduardo Rivera-Campo

Ehrhart polynomials are extensively-studied structures that interpolate the discrete volume of the dilations of integral $n$-polytopes. The coefficients of Ehrhart polynomials, however, are still not fully understood, and it is not known…

Combinatorics · Mathematics 2021-01-22 Fiona Abney-McPeek , Sanket Biswas , Senjuti Dutta , Yongyuan Huang , Deyuan Li , Nancy Xu

An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…

Computational Geometry · Computer Science 2007-05-23 Mirela Damian , Robin Flatland , Joseph O'Rourke

In this paper we extend general grid graphs to the grid graphs consist of polygons tiling on a plane, named polygonal grid graphs. With a cycle basis satisfied polygons tiling, we study the cyclic structure of Hamilton graphs. A Hamilton…

Discrete Mathematics · Computer Science 2012-04-25 Heping Jiang

We initiate the study of a class of polytopes, which we coin polypositroids, defined to be those polytopes that are simultaneously generalized permutohedra (or polymatroids) and alcoved polytopes. Whereas positroids are the matroids arising…

Combinatorics · Mathematics 2020-10-15 Thomas Lam , Alexander Postnikov

We study the problem of folding a polyomino $P$ into a polycube $Q$, allowing faces of $Q$ to be covered multiple times. First, we define a variety of folding models according to whether the folds (a) must be along grid lines of $P$ or can…

We consider a graph polynomial \xi(G;x,y,z) introduced by Averbouch, Godlin, and Makowsky (2007). This graph polynomial simultaneously generalizes the Tutte polynomial as well as a bivariate chromatic polynomial defined by Dohmen, Poenitz…

Combinatorics · Mathematics 2008-01-11 Christian Hoffmann

Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…

Combinatorics · Mathematics 2012-03-02 Martin Trinks

For a set of integers $I$, we define a $q$-ary $I$-cycle to be a assignment of the symbols 1 through $q$ to the integers modulo $q^n$ so that every word appears on some translate of $I$. This definition generalizes that of de Bruijn cycles,…

Combinatorics · Mathematics 2007-05-23 Joshua N. Cooper , Ronald L. Graham

The topological Tverberg theorem states that for any prime power q and continuous map from a (d+1)(q-1)-simplex to R}^d, there are q disjoint faces F_i of the simplex whose images intersect. It is possible to put conditions on which pairs…

Combinatorics · Mathematics 2011-09-14 Alexander Engstrom

Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda + \sum_{k = 1}^d [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are linear forms in…

Complex Variables · Mathematics 2007-05-23 Gabriel Katz