相关论文: Rational Angle Bisection Problem in Higher Dimensi…
We implement two-cover descent for plane quartics over Q with all 28 bitangents rational and show that on a significant collection of test cases, it resolves the existence of rational points. We also review a classical description of the…
We prove that if a linear equation, whose coefficients are continuous rational functions on a nonsingular real algebraic surface, has a continuous solution, then it also has a continuous rational solution. This is known to fail in higher…
Motivated by an open problem from graph drawing, we study several partitioning problems for line and hyperplane arrangements. We prove a ham-sandwich cut theorem: given two sets of n lines in R^2, there is a line l such that in both line…
Fix a finite group $G$. We seek to classify varieties with $G$-action equivariantly birational to a representation of $G$ on affine or projective space. Our focus is odd-dimensional smooth complete intersections of two quadrics, relating…
We investigate the 2-center problem for arbitrary strictly convex, centrally symmetric curves instead of usual circles. In other words, we extend the 2-center problem (from the Euclidean plane) to strictly convex normed planes, since any…
We generalize Khintchine's method of constructing totally irrational singular vectors and linear forms. The main result of the paper shows existence of totally irrational vectors and linear forms with large uniform Diophantine exponents on…
We study $N$-point rational distance sets ($\textrm{RDS}(N)$) on the parabola $y=x^2$. Previous approaches to the problem include efforts made using elliptic curves and diophantine chains, with successful analysis for $N\leq 4$. We extend…
In this paper, we present a synthetic solution to a geometric open problem involving the radical axis of two strangely defined circumcircles. The solution encapsulates two generalizations, one of which uses a powerful projective result…
In Lorentzian geometry, limited definition of angles restricts the use of angle bisectors in study of triangles. This paper redefines angle bisectors so that they can be used to study attributes of triangles. Using the new definition, this…
The formula for the dihedral angle of the simplex of n dimensions, arccos(1/n), is derived using classical geometry.
The classical Heron problem states: \emph{on a given straight line in the plane, find a point $C$ such that the sum of the distances from $C$ to the given points $A$ and $B$ is minimal}. This problem can be solved using standard geometry or…
Consider N equally-spaced points on a circle of circumference N. Choose at random n points out of $N$ on this circle and append clockwise an arc of integral length k to each such point. The resulting random set is made of a random number of…
Given a set $S$ of elements in a number field $k$, we discuss the existence of planar algebraic curves over $k$ which possess rational points whose $x$-coordinates are exactly the elements of $S$. If the size $|S|$ of $S$ is either $4,5$,…
Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…
We establish an analytic Hasse principle for linear spaces of affine dimension m on a complete intersection over an algebraic field extension K of Q. The number of variables required to do this is no larger than what is known for the…
We suggest a method of solving the problem of existence of a triangle with prescribed two bisectors and one third element which can be taken as one of the angles, the sides, the heights or the medians, or the third bisector.
To any $k$-dimensional subspace of $\mathbb Q^n$ one can naturally associate a point in the Grassmannian ${\rm Gr}_{n,k}(\mathbb R)$ and two shapes of lattices of rank $k$ and $n-k$ respectively. These lattices originate by intersecting the…
PhD dissertation consists in three lines of investigation involving rational elliptic surfaces, namely 1) a study of conic bundles on these surfaces; 2) an investigation of the possible intersection numbers of two sections and 3) a theorem…
We present subquadratic algorithms in the algebraic decision-tree model for several \textsc{3Sum}-hard geometric problems, all of which can be reduced to the following question: Given two sets $A$, $B$, each consisting of $n$ pairwise…
Using sparse-inducing norms to learn robust models has received increasing attention from many fields for its attractive properties. Projection-based methods have been widely applied to learning tasks constrained by such norms. As a key…