Related papers: Constellations and multicontinued fractions: appli…
We use a continued fraction approach to compare two statistical ensembles of quadrangulations with a boundary, both controlled by two parameters. In the first ensemble, the quadrangulations are bicolored and the parameters control their…
We demonstrate that microlensing can be used for detecting planets in binary stellar systems. This is possible because in the geometry of planetary binary systems where the planet orbits one of the binary component and the other binary star…
We derive an analytical closed expression to compute the minimum distance (quantified by the angle of separation measured from the center of the Earth) between any two satellites located at the same altitude and in circular orbits. We also…
In this paper, we explore the interrelationship between Eulerian numbers and B splines. Specifically, using B splines, we give the explicit formulas of the refined Eulerian numbers, and descents polynomials. Moreover, we prove that the…
Using contiguous relations we construct an infinite number of continued fraction expansions for ratios of generalized hypergeometric series 3F2(1). We establish exact error term estimates for their approximants and prove their rapid…
Triangulations of the 5-gon with no separating triangle nor quadrangle, so called 5c-triangulations, are a planar map family closely related to 5-connected planar triangulations. We show that 5c-triangulations are in bijection with…
A method to reproduce causal and symmetric monomials of fractional degree by integer shifts of the corresponding fractional B-splines, introduced by M. Unser and Th. Blue, is presented. Thus the traditional relation between the degree of…
Let G be a finite subgroup of GL_n(C). G-constellations are a scheme-theoretic generalization of orbits of G in C^n. We study flat families of G-constellations parametrised by an arbitrary resolution of the quotient space C^n/G. We develop…
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a…
We consider the numbers arising in the problem of normal ordering of expressions in canonical boson creation and annihilation operators. We treat a general form of a boson string which is shown to be associated with generalizations of…
We present particular solutions for the following important nonlinear second order differential equations: modified Emden, generalized Lienard, convective Fisher, and generalized Burgers-Huxley. For the latter two equations these solutions…
Using the concept of constant evasion to different sorts of suitable binary relations, we establish many cardinal invariants derived from the established cardinal invariants $\mathfrak{e}^\mathrm{const}_{n}$ and…
We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is…
In this paper we introduce a link between geometry of ordinary continued fractions and trajectories of points that moves according to the second Kepler law. We expand geometric interpretation of ordinary continued fractions to the case of…
In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…
In a series of papers, P. Blasiak et al. developed a wide-ranging generalization of Bell numbers (and of Stirling numbers of the second kind) that appears to be relevant to the so-called Boson normal ordering problem. They provided a…
n-recollements of triangulated categories and n-derived-simple algebras are introduced. The relations between the n-recollements of derived categories of algebras and the Cartan determinants, homological smoothness and Gorensteinness of…
Reasoning with defeasible and conflicting knowledge in an argumentative form is a key research field in computational argumentation. Reasoning under various forms of uncertainty is both a key feature and a challenging barrier for automated…
Using groups with triality we obtain some general multiplication formulas in Moufang loops, construct Moufang extensions of abelian groups, and describe the structure of minimal extensions for finite simple Moufang loops over abelian…
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…