Related papers: Building Bricks with Bricks, with Mathematica

The cyclic n-roots problem is an important benchmark problem for polynomial system solvers. We consider the pruning of cone intersections for a polyhedral method to compute series for the solution curves.

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

In the current paper we are seeking P1(y),P2(y),P3(y) with the highest possible degree polynomials with integer coefficients, and Q(y) via the lowest possible degree polynomial, such that P1(y)^3+P2(y)^3+P3(y)^3=Q(y). Actually, the solution…

This paper presents the first method for constructing bases for polynomial spline spaces over an arbitrary T-meshes (PT-splines for short). We construct spline basis functions for an arbitrary T-mesh by first converting the T-mesh into a…

We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…

Analytical methods are used to prove the existence of a periodic, symmetric solution with singularities in the planar 4-body problem. A numerical calculation and simulation are used to generate the orbit. The analytical method easily…

A method of modeling data with gaps by a sequence of curves has been developed. The new method is a generalization of iterative construction of singular expansion of matrices with gaps. Under discussion are three versions of the method…

I provide a systematic construction of points (defined over number fields) on Legendre elliptic curves over $\mathbb{Q}$: for any odd integer $n\geq 3$ my method constructs $n$ points on the Legendre curve and I show that rank of the…

We investigate the problem of carving an $n$-face triangulated three-dimensional polytope using a tool to make cuts modelled by either a half-plane or sweeps from an infinite ray. In the case of half-planes cuts, we present a deterministic…

In this paper we extend the polynomial time integration framework to include exponential integration for both partitioned and unpartitioned initial value problems. We then demonstrate the utility of the exponential polynomial framework by…

The paper represents the method for construction of the families of particular solutions to some new classes of $(n+1)$ dimensional nonlinear Partial Differential Equations (PDE). Method is based on the specific link between algebraic…

In this paper, we propose and analyze a multiscale method for a class of quasilinear elliptic problems of nonmonotone type with spatially multiscale coefficient. The numerical approach is inspired by the Localized Orthogonal Decomposition…

Let $(p_n)_n$ be either the $q$-Meixner or the $q$-Laguerre polynomials. We form a new sequence of polynomials $(q_n)_n$ by considering a linear combination of two consecutive $p_n$: $q_n=p_n+\beta_np_{n-1}$, $\beta_n\in \RR$. Using the…

The quadratic minimum spanning tree problem and its variations such as the quadratic bottleneck spanning tree problem, the minimum spanning tree problem with conflict pair constraints, and the bottleneck spanning tree problem with conflict…

Let $\mathbb F_{q^2}$ be the finite field with $q^2$ elements. We provide a simple and effective method, using reciprocal polynomials, for the construction of algebraic curves over $\mathbb F_{q^2}$ with many rational points. The curves…

Let $C_{k_1}, \ldots, C_{k_n}$ be cycles with $k_i\geq 2$ vertices ($1\le i\le n$). By attaching these $n$ cycles together in a linear order, we obtain a graph called a polygon chain. By attaching these $n$ cycles together in a cyclic…

Let $X$ be either a general hypersurface of degree $n+1$ in $\mathbb P^n$ or a general $(2,n)$ complete intersection in $\mathbb P^{n+1}, n\geq 4$. We construct balanced rational curves on $X$ of all high enough degrees. If $n=3$ or $g=1$,…

The problem of constructing a perfect cuboid is related to a certain class of univariate polynomials with three integer parameters $a$, $b$, and $u$. Their irreducibility over the ring of integers under certain restrictions for $a$, $b$,…

We study the problem of how to obtain an integer realization of a 3d polytope when an integer realization of its dual polytope is given. We focus on grid embeddings with small coordinates and develop novel techniques based on Colin de…

We can associate with any irreducible curve singularity (ics) a numerical semigroup. Two ics are said to be equisingular if they have the same semigroup. Two equisingular ics have the same Milnor number. Conversely, The set of ics with a…