scholarly journals Angle Sums of Schläfli Orthoschemes

Author(s):  
Thomas Godland ◽  
Zakhar Kabluchko

AbstractWe consider the simplices $$\begin{aligned} K_n^A=\{x\in {\mathbb {R}}^{n+1}:x_1\ge x_2\ge \cdots \ge x_{n+1},x_1-x_{n+1}\le 1,\,x_1+\cdots +x_{n+1}=0\} \end{aligned}$$ K n A = { x ∈ R n + 1 : x 1 ≥ x 2 ≥ ⋯ ≥ x n + 1 , x 1 - x n + 1 ≤ 1 , x 1 + ⋯ + x n + 1 = 0 } and $$\begin{aligned} K_n^B=\{x\in {\mathbb {R}}^n:1\ge x_1\ge x_2\ge \cdots \ge x_n\ge 0\}, \end{aligned}$$ K n B = { x ∈ R n : 1 ≥ x 1 ≥ x 2 ≥ ⋯ ≥ x n ≥ 0 } , which are called the Schläfli orthoschemes of types A and B, respectively. We describe the tangent cones at their j-faces and compute explicitly the sums of the conic intrinsic volumes of these tangent cones at all j-faces of $$K_n^A$$ K n A and $$K_n^B$$ K n B . This setting contains sums of external and internal angles of $$K_n^A$$ K n A and $$K_n^B$$ K n B as special cases. The sums are evaluated in terms of Stirling numbers of both kinds. We generalize these results to finite products of Schläfli orthoschemes of type A and B and, as a probabilistic consequence, derive formulas for the expected number of j-faces of the Minkowski sums of the convex hulls of a finite number of Gaussian random walks and random bridges. Furthermore, we evaluate the analogous angle sums for the tangent cones of Weyl chambers of types A and B and finite products thereof.

2017 ◽  
Vol 320 ◽  
pp. 595-629 ◽  
Author(s):  
Zakhar Kabluchko ◽  
Vladislav Vysotsky ◽  
Dmitry Zaporozhets

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 309-320 ◽  
Author(s):  
B.S. El-Desouky ◽  
Nenad Cakic ◽  
F.A. Shiha

In this paper we give a new family of numbers, called ??-Whitney numbers, which gives generalization of many types of Whitney numbers and Stirling numbers. Some basic properties of these numbers such as recurrence relations, explicit formulas and generating functions are given. Finally many interesting special cases are derived.


2016 ◽  
Vol 94 (5) ◽  
Author(s):  
Timo Dewenter ◽  
Gunnar Claussen ◽  
Alexander K. Hartmann ◽  
Satya N. Majumdar

Author(s):  
Raffaele Di Gregorio ◽  
Alessandro Cammarata ◽  
Rosario Sinatra

The comparison of mechanisms with different topology or with different geometry, but with the same topology, is a necessary operation during the design of a machine sized for a given task. Therefore, tools that evaluate the dynamic performances of a mechanism are welcomed. This paper deals with the dynamic isotropy of 2-dof mechanisms starting from the definition introduced in a previous paper. In particular, starting from the condition that identifies the dynamically isotropic configurations, it shows that, provided some special cases are not considered, 2-dof mechanisms have at most a finite number of isotropic configurations. Moreover, it shows that, provided the dynamically isotropic configurations are excluded, the geometric locus of the configuration space that collects the points associated to configurations with the same dynamic isotropy is constituted by closed curves. This results will allow the classification of 2-dof mechanisms from the dynamic-isotropy point of view, and the definition of some methodologies for the characterization of the dynamic isotropy of these mechanisms. Finally, examples of applications of the obtained results will be given.


2008 ◽  
Vol 18 (1) ◽  
pp. 23-36 ◽  
Author(s):  
A.I. Shawky ◽  
M.S. El-Paoumy

The aim of this paper is to derive the analytical solution of the queue: Hk/Ma,b/C/N with balking and reneging in which (I) units arrive according to a hyper-Poisson distribution with k independent branches, (II) the queue discipline is FIFO; and (III) the units are served in batches according to a general bulk service rule. The steady-state probabilities, recurrence relations connecting various probabilities introduced are found and the expected number of units in the queue is derived in an explicit form. Also, some special cases are obtained. .


10.37236/6516 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Megumi Asada ◽  
Ryan Chen ◽  
Florian Frick ◽  
Frederick Huang ◽  
Maxwell Polevy ◽  
...  

Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean $d$-space that guarantees any such point set admits a partition into $r$ parts, any $k$ of whose convex hulls intersect. Here we give new and improved lower bounds for this number, which Reay conjectured to be independent of $k$. We prove a colored version of Reay's conjecture for $k$ sufficiently large, but nevertheless $k$ independent of dimension $d$. Pairwise intersecting convex hulls have severely restricted combinatorics. This is a higher-dimensional analogue of Conway's thrackle conjecture or its linear special case. We thus study convex-geometric and higher-dimensional analogues of the thrackle conjecture alongside Reay's problem and conjecture (and prove in two special cases) that the number of convex sets in the plane is bounded by the total number of vertices they involve whenever there exists a transversal set for their pairwise intersections. We thus isolate a geometric property that leads to bounds as in the thrackle conjecture. We also establish tight bounds for the number of facets of higher-dimensional analogues of linear thrackles and conjecture their continuous generalizations.


2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Tamás Lengyel

International audience Let $n$ and $k$ be positive integers, $d(k)$ and $\nu_2(k)$ denote the number of ones in the binary representation of $k$ and the highest power of two dividing $k$, respectively. De Wannemacker recently proved for the Stirling numbers of the second kind that $\nu_2(S(2^n,k))=d(k)-1, 1\leq k \leq 2^n$. Here we prove that $\nu_2(S(c2^n,k))=d(k)-1, 1\leq k \leq 2^n$, for any positive integer $c$. We improve and extend this statement in some special cases. For the difference, we obtain lower bounds on $\nu_2(S(c2^{n+1}+u,k)-S(c2^n+u,k))$ for any nonnegative integer $u$, make a conjecture on the exact order and, for $u=0$, prove part of it when $k \leq 6$, or $k \geq 5$ and $d(k) \leq 2$. The proofs rely on congruential identities for power series and polynomials related to the Stirling numbers and Bell polynomials, and some divisibility properties.


2018 ◽  
Vol 97 (6) ◽  
Author(s):  
Hendrik Schawe ◽  
Alexander K. Hartmann ◽  
Satya N. Majumdar

1988 ◽  
Vol 25 (03) ◽  
pp. 624-629
Author(s):  
Stephen Scheinberg

Consider an ‘experiment' which can be repeated indefinitely often resulting in independent random outcomes. Fix attention on a finite number of possible (sets of) outcomes E 1, E 2, … and define W = W(N 1, N 2, …) to be the expected number of repetitions needed to ensure that E 1 has occurred (at least) N 1 times, E 2 has occurred (at least) N 2 times, etc. This article examines the asymptotic behavior of W as a function of the sum Σ j N j, as the latter grows without bound.


2015 ◽  
Vol 91 (5) ◽  
Author(s):  
Gunnar Claussen ◽  
Alexander K. Hartmann ◽  
Satya N. Majumdar

Sign in / Sign up

Export Citation Format

Share Document