相关论文: Effective Hasse principle for the intersection of …

We prove that a complete intersection of $c$ very general hypersurfaces of degree at least two in $N$-dimensional complex projective space is not ruled (and therefore not rational) provided that the sum of the degrees of the hypersurfaces…

In this paper we explore the intersection of the Hassett divisor $\mathcal C_8$, parametrizing smooth cubic fourfolds $X$ containing a plane $P$ with other divisors $\mathcal C_i$. Notably we study the irreducible components of the…

We prove the real non-attractive fixed point conjecture for complex polynomial and rational harmonic functions. A harmonic function $f=h+\overline{g}$ is polynomial (rational) if both $h$ and $g$ are polynomials (rational functions) of…

In this paper we will consider Rohde's general form of {1}-inverse of a matrix A. The necessary and sufficient condition for consistency of a linear system Ax=c will be represented. We will also be concerned with the minimal number of free…

Given a set $\mathcal A = \{a_1,\ldots,a_n\} \subset \mathbb{N}^m$ of nonzero vectors defining a simplicial toric ideal $I_{\mathcal A} \subset k[x_1,...,x_n]$, where $k$ is an arbitrary field, we provide an algorithm for checking whether…

This paper proposed a method to judge whether the point is inside or outside of the simple convex polygon by the intersection of the vertical line. It determined the point to an area enclosed by two straight lines, then convert the problem…

Conventionally, methods to solve macroscopic node model are discussed in algorithm or in algebraic point of view. In this paper, the geometric interpretation is discussed, focusing on an example in Flotterod and Rohde (2011). Via observing…

The Medusa algorithm takes as input two postcritically finite quadratic polynomials and outputs the quadratic rational map which is the mating of the two polynomials (if it exists). Specifically, the output is a sequence of approximations…

Let Fq be a finite field with q=8 or q at least 16. Let S be a smooth cubic surface defined over Fq containing at least one rational line. We use a pigeonhole principle to prove that all the rational points on S are generated via tangent…

We show that every cubic form with coefficients in an imaginary quadratic number field $K/\mathbb{Q}$ in at least $14$ variables represents zero non-trivially. This builds on the corresponding seminal result by Heath-Brown for rational…

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and…

Pascal's Theorem gives a synthetic geometric condition for six points $a,\ldots,f$ in $\mathbb{P}^2$ to lie on a conic. Namely, that the intersection points $\overline{ab}\cap\overline{de}$, $\overline{af}\cap\overline{dc}$,…

Many problems of theoretical and practical interest involve finding a convex or concave function. For instance, optimization problems such as finding the projection on the convex functions in $H^k(\Omega)$, or some problems in economics. In…

Quantum computing enables the efficient resolution of complex problems, often outperforming classical methods across various applications. In 2009, Harrow, Hassidim and Lloyd proposed an algorithm for solving linear systems of equations,…

We show that any subset of the squares of positive relative upper density contains non-trivial solutions to a translation-invariant linear equation in five or more variables, with explicit quantitative bounds. As a consequence, we establish…

The Hesse curve or Hesse derivative Hess$(\Gamma_f)$ of a cubic curve $\Gamma_{f}$ given by a homogeneous polynomial $f$ is the set of points $P$ such that $\det \left(H_f (P)\right)=0$, where $H_f (P)$ is the Hesse matrix of $f$ evaluated…

Line intersection with convex and un-convex polygons or polyhedron algorithms are well known as line clipping algorithms and very often used in computer graphics. Rendering of geometrical problems often leads to ray tracing techniques, when…

This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…

We investigate local-global principles for multinorm equations over a global field. To this extent, we generalize work of Drakokhrust and Platonov to provide explicit and computable formulae for the obstructions to the Hasse principle and…

The matroid intersection problem is a fundamental problem that has been extensively studied for half a century. In the classic version of this problem, we are given two matroids $\mathcal{M}_1 = (V, \mathcal{I}_1)$ and $\mathcal{M}_2 = (V,…