Related papers: Hyperfocused arcs in PG(2,32)
We introduce a new technique that is used to show that the complex projective plane blown up at 6, 7, or 8 points has infinitely many distinct smooth structures. None of these smooth structures admit smoothly embedded spheres with…
It is known that every multigraph with an even number of edges has an even orientation (i.e., all indegrees are even). We study parity constrained graph orientations under additional constraints. We consider two types of constraints for a…
We find all analytic surfaces in space R^3 such that through each point of the surface one can draw two circular arcs fully contained in the surface. The proof uses a new decomposition technique for quaternionic matrices.
The existence of certain monomial hyperovals $D(x^k)$ in the finite Desarguesian projective plane $PG(2,q)$, $q$ even, is related to the existence of points on certain projective plane curves $g_k(x,y,z)$. Segre showed that some values of…
We show, in this second part, that the maximal number of singular points of a quartic surface $X \subset \mathbb{P}^3_K$ defined over an algebraically closed field $K$ of characteristic 2 is at most 14, and that, if we have 14…
A simple counting argument is used to show that for all $q$, an Andr\'e hyper-regulus $\mathbb X$ in $PG(5,q)$ has exactly two switching sets. Moreover, there are exactly $2(q^2+q+1)$ planes in $PG(5,q)$ that meet every plane of $\mathbb X$…
We consider the problem of determining whether a given prime p is a congruent number. We present an easily computed criterion that allows us to conclude that certain primes for which congruency was previously undecided, are in fact not…
The classification of all semiovals and blocking semiovals in $\mathrm{PG}(2,8)$ and in $\mathrm{PG}(2,9)$ of size less than $17$ is determined. Also, some information on the stabilizer groups and the intersection sizes with lines is given.
Research about crossings is typically about minimization. In this paper, we consider \emph{maximizing} the number of crossings over all possible ways to draw a given graph in the plane. Alpert et al. [Electron. J. Combin., 2009] conjectured…
A monoid hypersurface is an irreducible hypersurface of degree d which has a singular point of multiplicity d-1. Any monoid hypersurface admits a rational parameterization, hence is of potential interest in computer aided geometric design.…
Given two rational, properly parametrized space curves ${\mathcal C}_1$ and ${\mathcal C}_2$, where $\CCC_2$ is contained in some plane $\Pi$, we provide an algorithm to check whether or not there exist perspective or parallel projections…
In this paper, it is proved that there is, up to isomorphism, a unique generalized quadrangle of order (4,16).
We introduce a new arc in directed graphs of integers. Among other things, we determine the positive integers that have arcs to all except a finite number of positive integers. We also propose some possible research problems at the end of…
In this paper, we prove there exist at least four geometrically distinct closed characteristics on every compact convex hypersurface $\Sg$ in $\R^8$. This gives a confirmed answer in the case $n=4$ to a long standing conjecture in…
We study here the graphs with seven vertices in an effort to classify which of them appear as the prime character degree graphs of finite solvable groups. This classification is complete for the disconnected graphs. Of the 853…
In a projective plane over a finite field, complete $(k,n)$-arcs with few characters are rare but interesting objects with several applications to finite geometry and coding theory. Since almost all known examples are large, the…
We note the significance of hypergraphic planted clique (HPC) detection in the investigation of computational hardness for a range of tensor problems. We ask if more evidence for the computational hardness of HPC detection can be developed.…
We discuss and prove a number of results for calculating characteristic cycles, or graded, enriched characteristic cycles. We concentrate particularly on results related to hypersurfaces.
We show that the problem of counting perfect matchings remains #P-complete even if we restrict the input to very dense graphs, proving the conjecture in [5]. Here "dense graphs" refer to bipartite graphs of bipartite independence number…
We revisit constructions based on triads of conics with foci at pairs of vertices of a reference triangle. We find that their 6 vertices lie on well-known conics, whose type we analyze. We give conditions for these to be circles and/or…