相关论文: Algebraic and arithmetic area for $m$ planar Brown…

We show the power of Bruno Buchberger's seminal Groebner Basis algorithm, interfaced, seamlessly, with what we call symbolic dynamical programming, to automatically generate algebraic equations satisfied by the generating functions…

In this work we prove that a semialgebraic set $M\subset{\mathbb R}^m$ is determined (up to a semialgebraic homeomorphism) by its ring ${\mathcal S}(M)$ of (continuous) semialgebraic functions while its ring ${\mathcal S}^*(M)$ of…

We compare metrics obtained through analytic perturbation theory with their numerical counterparts. The analytic solutions are computed with the CMMR post-Minkowskian and slow rotation approximation due to Cabezas et al. (2007) for an…

Semialgebraic splines are functions that are piecewise polynomial with respect to a cell decomposition into sets defined by polynomial inequalities. We study bivariate semialgebraic splines, formulating spaces of semialgebraic splines in…

We use a Hamiltonian (transition matrix) description of height-restricted Dyck paths on the plane in which generating functions for the paths arise as matrix elements of the propagator to evaluate the length and area generating function for…

In this article we study the convex hull spanned by the union of trajectories of a standard planar Brownian motion, and an independent standard planar Brownian bridge. We find exact values of the expectation of perimeter and area of such a…

In the presence of a positive, compactly supported measure on an affine algebraic curve, we relate the density of polynomials in Lebesgue $L^2$-space to the existence of analytic bounded point evaluations. Analogues to the complex plane…

We study geodesics in the random metric space called the Brownian map, which appears as the scaling limit of large planar maps. In particular, we completely describe geodesics starting from the distinguished point called the root, and we…

Andrews plots provide aesthetically pleasant visualizations of high-dimensional datasets. This work proves that Andrews plots (when defined in terms of the principal component scores of a dataset) are optimally ``smooth'' on average, and…

We present a new explicit formula for the $m$-th Bernoulli number $B_m$, which involves two integer parameters $a$ and $n$ with $0\le a\le m\le n$. If we set $a=0$ and $n=m$, then the formula reduces to the celebrated Kronecker formula for…

In this paper we study the asymptotic behavior of Brownian motion in both comb-shaped planar domains, and comb-shaped graphs. We show convergence to a limiting process when both the spacing between the teeth \emph{and} the width of the…

We enumerate the number of $T$-splitting subspaces of dimension $m$ for an arbitrary operator $T$ on a $2m$-dimensional vector space over a finite field. When $T$ is regular split semisimple, comparison with an alternate method of…

Periods are defined as integrals of semialgebraic functions defined over the rationals. Periods form a countable ring not much is known about. Examples are given by taking the antiderivative of a power series which is algebraic over the…

Charged particle motion in axisymmetric toroidal magnetic fields is analyzed within the context of the canonical Hamiltonian Guiding Center theory. A canonical transformation to variables measuring the drift orbit deviation from a magnetic…

Weyl's expansion for the asymptotic mode density of billiards consists of the area, length, curvature and corner terms. The area term has been associated with the so-called zero-length orbits. Here closed nonperiodic paths corresponding to…

This paper describes an algorithm for determining the branching geometry of algebraic functions. The graphs of these complex-valued functions have a complicated interweaving structure that can be described by analytic branches separated by…

The algebraic path problem provides a general setting for shortest path algorithms in optimization and computer science. This work extends the algebraic path problem to networks equipped with input and output boundaries. We show that the…

Recently, a method to compute the implicit equation of a parametrized hypersurface has been developed by the authors. We address here some questions related to this method. First, we prove that the degree estimate for the stabilization of…

Nisan showed in 1991 that the width of a smallest noncommutative single-(source,sink) algebraic branching program (ABP) to compute a noncommutative polynomial is given by the ranks of specific matrices. This means that the set of…

A simultaneous arithmetic progression (s.a.p.) of length k consists of k points (x_i, y_\sigma(i)), where x_i and y_i are arithmetic progressions and \sigma is a permutation. Garcia-Selfa and Tornero asked whether there is a bound on the…