Related papers: Generators for Cubic Surfaces with two Skew Lines …

Segre proved that a smooth cubic surface over Q is unirational iff it has a rational point. We prove that the result also holds for cubic hypersurfaces over any field, including finite fields.

Let R be the ring of algebraic integers in a number field K and let L be a maximal order in a semisimple K-algebra B. Building on our previous work, we compute the smallest number of algebra generators of L considered as an R-algebra. This…

We present a framework for constructing examples of smooth projective curves over number fields with explicitly given elements in their second K-group using elementary algebraic geometry. This leads to new examples for hyperelliptic curves…

We show that the skein vector space of the 3-torus is finitely generated. We show that it is generated by 9 elements: the empty set, some simple closed curves representing the non null elements of the first homology group with coefficients…

A drawing of a graph is $k$-plane if every edge contains at most $k$ crossings. A $k$-plane drawing is saturated if we cannot add any edge so that the drawing remains $k$-plane. It is well-known that saturated $0$-plane drawings, that is,…

Let $$1 \to H \to G \to Q \to 1$$ be an exact sequence where $H= \pi_1(S)$ is the fundamental group of a closed surface $S$ of genus greater than one, $G$ is hyperbolic and $Q$ is finitely generated free. The aim of this paper is to provide…

3D printing and other layer manufacturing processes are challenged by dimensional accuracy. Several techniques are used to validate and calibrate dimensional accuracy through the complete building envelope. The validation process involves…

A method is given that "inverts" a logic grammar and displays it from the point of view of the logical form, rather than from that of the word string. LR-compiling techniques are used to allow a recursive-descent generation algorithm to…

This paper presents a new algorithm "A" for constructing Seifert surfaces from n-bridge projections of links. The algorithm produces minimal complexity surfaces for large classes of braids and alternating links. In addition, we consider a…

Let C be a smooth cubic curve in the complex projective plane. We show that for every positive integer k, there are only finite number of rational curves of degree k each intersects the cubic C at exactly one point. The number of such…

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…

We construct explicit generators for the higher scissors congruence K-theory of the line. We use this to derive an explicit generating set for the homology of the group of interval exchange transformations. Our proof makes use of an…

Let $X$ be a rational surface obtained by blowing up at a configuration $\mathcal{C}$ of infinitely near points over a Hirzebruch surface $\mathbb{F}_\delta$. We prove that there exist two positive integers $a \leq b$ such that the cone of…

A collection $ \Delta $ of simple closed curves on an orientable surface is an algebraic $ k $-system if the algebraic intersection number $\langle \alpha,\beta \rangle$ is equal to $k $ in absolute value for every $ \alpha , \beta \in…

We study points and 0-cycles on del Pezzo surfaces defined over a field K of characteristic 0, with emphasis on cubic surfaces. We prove that a cubic surface that admits a point defined over a field extension of K of degree coprime to 3…

We investigate the number of straight lines contained in a K3 quartic surface \(X\) defined over an algebraically closed field of characteristic 3. We prove that if \(X\) contains 112 lines, then \(X\) is projectively equivalent to the…

This paper introduces advances in the geometry of the ratio of either two or three points in a line in the Desargues affine plane, and we see this as a ratio of elements of skew field which are constructed over a line in Desargues affine…

A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response…

We examine sets of lines in PG(d,F) meeting each hyperplane in a generator set of points. We prove that such a set has to contain at least 1.5d lines if the field F has more than 1.5d elements, and at least 2d-1 lines if the field F is…

Given a non-decreasing sequence S = (s 1,s 2,. .. ,s k) of positive integers, an S-packing edge-coloring of a graph G is a partition of the edge set of G into k subsets {X 1 ,X 2,. .. ,X k } such that for each 1 $\le$ i $\le$ k, the…