Related papers: Generalized ODE reduction algorithm with bounded d…

Let $f(t, y,y')=\sum_{i=0}^d a_i(t, y)y'^i=0$ be a first order ordinary differential equation with polynomial coefficients. Eremenko in 1999 proved that there exists a constant $C$ such that every rational solution of $f(t, y,y')=0$ is of…

There are major advantages in a newer version of Grover's quantum algorithm utilizing a general unitary transformation in the search of a single object in a large unsorted database. In this paper, we generalize this algorithm to multiobject…

Let $p$ be an odd natural number $\ge 3$. Inspired by results from Euclid's {\em Elements}, we express the irrational $$y=\sqrt[p]{d+\sqrt R}, $$ whose degree is $2p$, as a polynomial function of irrationals of degrees $\le p$. In certain…

For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…

In this paper we adapt the method of [P. H. Baptistelli, M. Manoel and I. O. Zeli. Normal form theory for reversible equivariant vector fields. Bull. Braz. Math. Soc., New Series 47 (2016), no. 3, 935-954] to obtain normal forms of a class…

Integral operators of Abel type of order a > 0 arise naturally in a large spectrum of physical processes. Their inversion requires care since the resulting inverse problem is ill-posed. The purpose of this work is to devise and analyse a…

A new (algebraic) approximation scheme to find {\sl global} solutions of two point boundary value problems of ordinary differential equations (ODE's) is presented. The method is applicable for both linear and nonlinear (coupled) ODE's whose…

We study the inverse problem of recovering a vector field in $\mathbb{R}^2$ from a set of new generalized $V$-line transforms in three different ways. First, we introduce the longitudinal and transverse $V$-line transforms for vector fields…

The paper presents a new generalized integer orthogonal transformation which consists of a well known orthogonal transform followed by stretching the basis vectors maintaining the asymptotic behavior of the number of integer solutions for…

M\"obius inversion and Shapley values are two mathematical tools for characterizing and decomposing higher-order structure in complex systems. The former defines higher-order interactions as discrete derivatives over a partial order; the…

This article studies the inverse problem of recovering a vector field supported in $\mathbb{D}_R$, the disk of radius $R$ centered at the origin, through a set of generalized broken ray/V-line transforms, namely longitudinal and transverse…

Let $Y=\{f(x,y)=0\}$ be the germ of an irreducible plane curve. We present an algorithm to obtain polynomials, whose valuations coincide with the semigroup generators of $Y$. These polynomials are obtained sequentially, adding terms to the…

Let P(x,y) be a rational polynomial and k in Q be a generic value. If the curve (P(x,y)=k) is irreducible and admits an infinite number of points whose coordinates are integers then there exist algebraic automorphisms that send P(x,y) to…

This paper introduces a novel method for the efficient second-order accurate computation of normal fields from volume fractions on unstructured polyhedral meshes. Locally, i.e. in each mesh cell, an averaged normal is reconstructed by…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

We present a $p$-adic algorithm to recover the lexicographic Gr\"obner basis $\mathcal G$ of an ideal in $\mathbb Q[x,y]$ with a generating set in $\mathbb Z[x,y]$, with a complexity that is less than cubic in terms of the dimension of…

We consider a multi-block separable convex optimization problem with the linear constraints, where the objective function is the sum of m individual convex functions without overlapping variables. The linearized version of the generalized…

We develop a polynomial reduction procedure that transforms any gauge fixed CHY amplitude integrand for $n$ scattering particles into a $\sigma$-moduli multivariate polynomial of what we call the $\textit{standard form}$. We show that a…

In this paper we investigate the computational complexity of solving ordinary differential equations (ODEs) $y^{\prime}=p(y)$ over \emph{unbounded time domains}, where $p$ is a vector of polynomials. Contrarily to the bounded (compact) time…

The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph $G$. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some…