Related papers: Partial fraction decompositions on hyperplane arra…
In this paper we describe the method which we applied to successfully compute the primary decomposition of a certain ideal coming from applications in combinatorial algebra and algebraic statistics regarding conditional independence…
This paper proposes the design of Fractional Order (FO) Butterworth filter in complex w-plane (w=sq; q being any real number) considering the presence of under-damped, hyper-damped, ultra-damped poles. This is the first attempt to design…
Comparison of stellar catalogues with position and proper motion components using a decomposition on a set of orthogonal vector spherical harmonics. We show the theoretical and practical advantages of this technique as a result of…
We adopt the integral definition of the fractional Laplace operator and analyze an optimal control problem for a fractional semilinear elliptic partial differential equation (PDE); control constraints are also considered. We establish the…
A new approach for decoding binary linear codes by solving a linear program (LP) over a relaxed codeword polytope was recently proposed by Feldman et al. In this paper we investigate the structure of the polytope used in the LP relaxation…
While discrete harmonic functions have been objects of interest for quite some time, this is not the case for discrete polyharmonic functions, as appear for instance in the asymptotics of path counting problems. In this article, a novel…
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…
The submodular partitioning problem asks to minimize, over all partitions $P$ of a ground set $V$, the sum of a given submodular function $f$ over the parts of $P$. The problem has seen considerable work in approximability, as it…
Within recent years, considerable progress has been made regarding high-performance solvers for Partial Differential Equations (PDEs), yielding potential gains in efficiency compared to industry standard tools. However, the latter largely…
We present the integrand reduction via multivariate polynomial division as a natural technique to encode the unitarity conditions of Feynman amplitudes. We derive a recursive formula for the integrand reduction, valid for arbitrary…
We consider a wide class of semi linear Hamiltonian partial differential equa- tions and their approximation by time splitting methods. We assume that the nonlinearity is polynomial, and that the numerical tra jectory remains at least uni-…
We calculate the decomposition series of the D-module defined as the push-forward of a rank one linear system on the complement of a normal crossings hyperplane configuration and use data of a resolution of singularities to give a…
We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…
We study a reliable pole selection for the rational approximation of the resolvent of fractional powers of operators in both the finite and infinite dimensional setting. The analysis exploits the representation in terms of hypergeometric…
In this paper we propose a new efficient interpolation tool, extremely suitable for large scattered data sets. The partition of unity method is used and performed by blending Radial Basis Functions (RBFs) as local approximants and using…
In this paper we propose an Almansi-type decomposition for slice regular functions of several quaternionic variables. Our method yields $2^n$ distinct and unique decompositions for any slice function with domain in $\mathbb{H}^n$. Depending…
We consider the QCD factorization of DIS structure functions at small x and amplitudes of 2->2 -hadronic forward scattering at high energy. We show that both collinear and k_T-factorization for these processes can be obtained approximately…
The Euler characteristic of a very affine variety encodes the algebraic complexity of solving likelihood (or scattering) equations on this variety. We study this quantity for the Grassmannian with $d$ hyperplane sections removed. We provide…
It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous $G$-algebras, are finite factorization domains (FFD for short). Utilizing this result, we contribute an algorithm to…
Fundamental rules and definitions of Fractional Differintegrals are outlined. Factorizing 1-D and 2-D Helmholtz equations four fractional eigenfunctions are determined. The functions exhibit incident and reflected plane waves as well as…