Related papers: Complexity lower bound for typical right triangula…
We obtain an explicit formula for a certain weighted enumeration of lozenge tilings of a hexagon with an arbitrary triangular hole. The complexity of our expression depends on the distance from the hole to the center of the hexagon. This…
We provide an upper bound on the topological complexity of twisted products. We use it to give an estimate $$TC(X)\le TC(\pi_1(X))+\dim X$$ of the topological complexity of a space in terms of its dimension and the complexity of its…
The principal angles between binary collision subspaces in an $N$-billiard system in $d$-dimensional Euclidean space are computed. These angles are computed for equal masses and arbitrary masses. We then provide a bound on the number of…
We investigate a rotated, orthogonal gravitational wedge billiard - a special case of the asymmetric wedge billiard - in which the dynamics are integrable. We derive equations and conditions under which periodic orbits may be constructed…
In this paper we survey the computational time complexity of assorted simple stochastic game problems, and we give an overview of the best known algorithms associated with each problem.
The aim of the present paper is to propose and study a dissipative variant of symplectic billiards within planar strictly convex domains. The associated billiard map is dissipative, thus it admits a compact invariant set, the so-called…
A numerically efficient Fredholm formulation of the billiard problem is presented. The standard solution in the framework of the boundary integral method in terms of a search for roots of a secular determinant is reviewed first. We next…
In this note we further develop the idea of using a ``black box'' point of view (see our previous work) to study eigenfunctions for billiards which have rectangular components: they include the Bunimovich billiard, the Sinai billiard, and…
We introduce the notion of a Billiard Array. This is an equilateral triangular array of one-dimensional subspaces of a vector space $V$, subject to several conditions that specify which sums are direct. We show that the Billiard Arrays on…
In this article we introduce a simple dynamical system called symplectic billiards. As opposed to usual/Birkhoff billiards, where length is the generating function, for symplectic billiards symplectic area is the generating function. We…
We give new lower bounds for $L^p$ estimates of the Schr\"odinger maximal function by generalizing an example of Bourgain.
In this paper, we present the first nontrivial lower bound on the translative covering density of tetrahedra. To this end, we show the lower bound, in any translative covering of tetrahedra, on the density relative to a given cube. The…
In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal pseudomanifolds, including a treatment of the cases of equality in this theorem. We also discuss McMullen and Walkup's generalised lower…
The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in earlier work, and, unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed…
Yet more candidates are proposed for inclusion in the Encyclopedia of Triangle Centers. Our focus is entirely on simple calculations.
In this note we prove some Rogers-Shepard type inequalities for the lengths of shortest closed billiard trajectories, mostly in the planar case. We also establish some properties of closed billiard trajectories in Hanner polytopes, having…
The purpose of this paper is to study the dynamics of a square billiard with a non-standard reflection law such that the angle of reflection of the particle is a linear contraction of the angle of incidence. We present numerical and…
We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.
Fractional pebbling is a generalization of black-white pebbling introduced recently. In this reasearch paper we solve an open problem by proving a tight lower bound on the pebble weight required to fractionally pebble a balanced d-ary tree…
We prove a lower bound $\Omega\left(\frac{k+l}{k^2l^2}N^{2-\frac{k+l+2}{kl}}\right)$ on the maximal possible weight of a $(k,l)$-free (that is, free of all-ones $k\times l$ submatrices) Boolean circulant $N \times N$ matrix. The bound is…