Related papers: Integral points in rational polygons: a numerical …
The central component of a polygon triangulation is defined as the triangle or diameter that contain its geometric center. More generally, every polygon dissection contains a central component. Using this notion, we derive new recurrences…
A general method is described for finding algebraic expressions for matrix elements of any one- and two-particle operator for an arbitrary number of subshells in an atomic configuration, requiring neither coefficients of fractional…
In these notes we investigate the rings of real polynomials in four variables, which are invariant under the action of the reflectiongroups [3,4,3] and [3,3,5]. It is well known that they are rationally generated in degree 2,6,8,12 and…
We establish asymptotic formulas for the number of integral points of bounded height on partial equivariant compactifications of vector groups.
The goal of this paper is to determine the number of perpendicularly inscribed polygons that intersect a given side of a regular polygon with an odd number of sides. This is done using circular permutations with repetition, and some special…
Functional integrals are central to modern theories ranging from quantum mechanics and statistical thermodynamics to biology, chemistry, and finance. In this work we present a new method for calculating functional integrals based on a…
We give a formula computing the number of one-nodal rational curves that pass through an appropriate collection of constraints in a complex projective space. We combine the methods and results from three different papers.
We look at the elliptic curve E(q), where q is a fixed rational number. A point (p,r) on E(q) is called a rational point if both p and r are rational numbers. We introduce the concept of conjugate points and show that not both can be…
We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals resp. over finite fields, and…
For a triangle $\Delta$, let (P) denote the problem of the existence of points in the plane of $\Delta$, that are at rational distance to the 3 vertices of $\Delta$. Answer to (P) is known to be positive in the following situation: $\Delta$…
Consider two circles, externally tangential,and with integer radii R1, R2; and with R1>R2.The two circles have three tangent lines in common, one of them being T1T2. If M is the midpoint of T1T2, and K the point of intersection of the lines…
There has been significant recent interest in studying how the number of numerical semigroups of genus $g$ behaves as a function of $g$. Bras-Amor\'os has shown how to organize the collection of numerical semigroups of genus $g$ into a…
We present a new method for the numerical evaluation of arbitrary loop integrals in dimensional regularization. We first derive Mellin-Barnes integral representations and apply an algorithmic technique, based on the Cauchy theorem, to…
Refining an argument of the second author, we improve the known bounds for the number of rational points near a submanifold of $\mathbb{R}^d$ of intermediate dimension under a natural curvature condition. Furthermore, in the codimension $2$…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
We present a new rational approximation algorithm based on the empirical interpolation method for interpolating a family of parametrized functions to rational polynomials with invariant poles, leading to efficient numerical algorithms for…
Let $f,g \in k[x]$ be nonconstant polynomials over a number field $k$. We count $S$-integer inputs $a$ for which $f(a)$ has a $k$-rational preimage under $g$, after removing the polynomial graph components $Y=h(X)$ with $f=g\circ h$. The…
Let $L$ be a simply-connected simple connected algebraic group over a number field $F$, and $H$ be a semisimple absolutely maximal connected $F$-subgroup of $L$. Under a cohomological condition, we prove an asymptotic formula for the number…
Using classical results of Rogers bounding the $L^2$-norm of Siegel transforms, we give bounds on the heights of approximate integral solutions of quadratic equations and error terms in the quantiative Oppenheim theorem of…
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…