Related papers: Some cut-generating functions for second-order con…
The purpose of this paper has twofold. The first is to establish a second main theorem with truncated counting functions for algebraically nondegenerate meromorphic mappings into an arbitrary projective variety intersecting a family of…
An extension of sinc interpolation on $\mathbb{R}$ to the class of algebraically decaying functions is developed in the paper. Similarly to the classical sinc interpolation we establish two types of error estimates. First covers a wider…
We give an effective procedure that produces a natural number in its output from any natural number in its input, that is, it computes a total function. The elementary operations of the procedure are Turing-computable. The procedure has a…
D. S. Hong and P. Pongsriiam have provided a necessary and sufficient condition for the generating function for Fibonacci numbers (resp. the Lucas numbers) to be an integer value, for rational numbers. In other words, their results relate…
Algorithms are proposed for the computation of set-valued quantiles and the values of the lower cone distribution function for bivariate data sets. These new objects make data analysis possible involving an order relation for the data…
First-order model counting (FOMC) is a computational problem that asks to count the models of a sentence in finite-domain first-order logic. In this paper, we argue that the capabilities of FOMC algorithms to date are limited by their…
It is shown that if A generates a bounded cosine operator function on a UMD space X, then i(-A)^{1/2} generates a bounded C_0-group. The proof uses a transference principle for cosine functions.
Consider all possible ways of attaching disjoint chords to two ordered and oriented disjoint intervals so as to produce a connected graph. Taking the intervals to lie in the real axis with the induced orientation and the chords to lie in…
In this paper we consider a problem of searching a space of predictive models for a given training data set. We propose an iterative procedure for deriving a sequence of improving models and a corresponding sequence of sets of non-linear…
This paper presents an alternate choice of computing the convex hulls (CHs) for planar point sets. We firstly discard the interior points and then sort the remaining vertices by x- / y- coordinates separately, and later create a group…
We derive the algebraic generating function for inversion sequences avoiding the patterns $201$ and $210$ by describing a set of succession rules, converting them to a system of generating function equations with one catalytic variable, and…
Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, best known as a procedure to enable Quantifier Elimination over real-closed fields. However, it has a worst case complexity doubly exponential in…
In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…
This paper presents a new column-and-constraint generation method for two-stage robust mixed-integer programs with finite uncertainty sets. Our method combines and extends speed-up techniques used in previous column-and-constraint…
We consider two non-linear generalizations of fractal interpolating functions generated from iterated function systems. The first corresponds to fitting data using a Kth-order polynomial, while the second relates to the freedom of adding…
Folding subgroups give a way to realize non-simply-laced Coxeter groups as subgroups of simply-laced Coxeter groups. In this paper, we study how folding subgroups of finite and affine type are distributed length-wise by calculating the…
In this paper we propose a new approach to the central limit theorem (CLT), based on functions of bounded F\'echet variation for the continuously differentiable linear statistics of random matrix ensembles which relies on: a weaker form of…
To distinguish the contributions to the generalized Hurwitz number of the source Riemann surface with different genus, we define the genus expanded cut-and-join operators by observing carefully the symplectic surgery and the gluing formulas…
Real-world applications of computational fluid dynamics often involve the evaluation of quantities of interest for several distinct geometries that define the computational domain or are embedded inside it. For example, design optimization…
Let $\cT$ be a monadic-second order class of finite trees, and let $\bT(x)$ be its (ordinary) generating function, with radius of convergence $\rho$. If $\rho \ge 1$ then $\cT$ has an explicit specification (without using recursion) in…