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

The deck of a graph $X$, $D(X)$, is defined as the multiset of all vertex-deleted subgraphs of $X$. Two graphs are said to be hypomorphic, if they have the same deck. Kelly-Ulam conjecture states that any two hypomorphic graphs on at least…

Soit l un entier et E_{c,l} la famille de Kubert des courbes elliptiques definies sur Q munies d'un point rationnel A d'ordre l. On note F_{c,l} la courbe elliptique quotient de E_{c,l} par le groupe engendre' par A, et f_l l'isogenie de…

Consider the smooth quadric Q_6 in P^7. The middle homology group H_6(Q_6,Z) is two-dimensional with a basis given by two classes of linear subspaces. We classify all threefolds of bidegree (1,p) inside Q_6.

We consider the issue of when the L-polynomial of one curve over $\F_q$ divides the L-polynomial of another curve. We prove a theorem which shows that divisibility follows from a hypothesis that two curves have the same number of points…

Suppose $k$ is a positive integer and $\mathcal{X}$ is a $k$-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most $k$ sets. Suppose there is a function…

Let $C$ be a smooth projective curve defined over $\Qbar$, let $\pi:\mathcal{E}\lra C$ be an elliptic surface and let $\sigma_{P_1},\sigma_{P_2},\sigma_{Q}$ be sections of $\pi$ (corresponding to points $P_1,P_2, Q$ of the generic fiber $E$…

A polygonal surface in the pseudo-hyperbolic space H^(2,n) is a complete maximal surface bounded by a lightlike polygon in the Einstein universe Ein^(1,n) with finitely many vertices. In this article, we give several characterizations of…

A seminal theorem of Tverberg states that any set of $T(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Almost any collection of fewer points in…

This article provides the basic algebraic background on infinitesimal deformations and presents the proof of the well-known fact that the non-trivial infinitesimal deformations of a $K$-algebra $R$ are parameterized by the elements of…

A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. The problem of finding edge-disjoint Hamiltonian cycles in a given regular graph has many applications in combinatorial optimization and…

An $H$-decomposition of $G$ is a partition of the edge-set of $G$ into subsets, where each subset induces a copy of the graph $H$. A $k$-orthogonal $H$-decomposition of a graph $G$ is a set of $k$ $H$-decompositions of $G$, such that any…

Let $N$ be a square-free integer such that the arithmetic group $\Gamma_0(N)^+$ has genus zero; there are $44$ such groups. Let $j_N$ denote the associated Hauptmodul normalized to have residue equal to one and constant term equal to zero…

Let $\mathbb R_t[\theta]$ be the ring generated over $\mathbb R$ by $\cos\theta$ and $\sin\theta$, and $\mathbb R_t(\theta)$ be its quotient field. In this paper we study the ways in which an element p of $\mathbb R_t[\theta]$ can be…

We ask which degree sequences admit a unique realisation as a $3$-polytopal graph (polyhedron) on $p$ vertices. We give an exhaustive list of these sequences for the case where one degree equals $p-1$ and exactly two or three of them equal…

Inspired by the study of loose cycles in hypergraphs, we define the \emph{loose core} in hypergraphs as a structure which mirrors the close relationship between cycles and $2$-cores in graphs. We prove that in the $r$-uniform binomial…

In 2023 we obtained a $Q$-polynomial structure for the projective geometry $L_N(q)$. In the present paper, we display a more general $Q$-polynomial structure for $L_N(q)$. Our new $Q$-polynomial structure is defined using a free parameter…

Barnette conjectured that all cubic $3$-connected plane graphs with maximum face size at most $6$ are hamiltonian. We provide a method of construction of a hamiltonian cycle (in dual terms) in an arbitrary cubic, $3$-connected plane graph…

We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watchman routes that guard the facets of a polytope. We consider…

A smooth hypersurface over a finite field $\mathbb{F}_q$ is called Frobenius nonclassical if the image of every geometric point under the $q$-th Frobenius endomorphism remains in the unique hyperplane tangent to the point. In this paper, we…

Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…