Senshu University (専修大学, Senshū Daigaku) is a private university in Chiyoda, Tokyo, Japan.
In this paper, we prove an n-point boundary rigidity theorem on bounded symmetric domains in & Copf;(n) and on complex Hilbert balls, respectively. Next, we prove several Burns-Krantz boundary rigidity theorems on complex Hilbert balls. Finally, we give examples which show that boundary rigidity theorems do not hold for holomorphic mappings from the unit polydisk Delta(n)to Delta(N), where N > n >= 1. The obtained results provide the improvements and extensions of the corresponding known results. (c) 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
Recent measurements of B(E2) values in even-even Te isotopes have revealed a smooth evolution of quadrupole collectivity, with only a slight asymmetry across the middle of the shell. These findings confirm that the only nucleus exhibiting an "anomalous" B4/2 ratio (B4/2 G 1) in even-even Te isotopes is 114Te. To further investigate this anomaly, lifetime measurements were carried out in the odd-mass isotope 115Te (N = 63), focusing on the 15/2- and 19/2- negative-parity levels in the nu h11/2 band, which are the analog states of the 2+ and 4+ levels in neighboring even-even nuclei. The extracted B(E2) values for 115Te indicate a "normal" behavior, with a B4/2 ratio greater than unity, further restricting the extent of the anomalous region in Te isotopes with B4/2 G 1 to the lower mass region with A G 114. The results have been interpreted using multiple theoretical frameworks: the shell model with the realistic pairing plus multipole terms with monopole interaction, large-scale configuration-interaction shell-model calculations, and the interacting boson-fermion model with triaxial deformation. The models give a fair reproduction of the experimental data, but fail to capture the detailed trend in the case of the B4/2 values.
Background/Objectives: In pole vaulting, the capacity to store elastic energy within the pole (E-pole) significantly influences performance. This study investigated the characteristics of E-pole storage by analyzing the box reaction force and vector angle. Methods: Eight male pole vaulters, including World Championships participants, were examined. A motion capture system (VICON) and force plates (Kistler) were used to measure the vector angle (angle between the compression force (CF) and box reaction force vectors) and horizontal velocity of the center of gravity (COG) (Vcogh). E-pole was calculated as the integral of the CF (estimated from the box reaction forces), and pole bending displacement. The relationships between each variable and the peak height of COG (HP) were assessed using Pearson's product-moment correlation coefficients. Results: HP correlated with Vcogh in the pole plant (PP) (r = 0.82) and E-pole (r = 0.94). Vaulters with a higher HP maintained a vector angle < 2 degrees between 20% and 80% of the pole bending phase, indicating closer directional alignment between the box reaction force vector and pole chord direction, whereas vaulters with lower HP exhibited larger vector angles (4-8 degrees), associated with a relative reduction in the axial component of force transmitted to the pole. Conclusions: A smaller vector angle effectively enhanced the CF, thereby increasing pole bending and promoting greater accumulation of E-pole. Therefore, maintaining a small vector angle may enable more effective force transmission along the pole chord, and vector angle characteristics and PP horizontal velocity may assist appropriate pole selection and training strategies to enhance elastic energy storage and performance.
This study analyzes spatial Cournot competition in a network economy with interconnecting one central node and three peripheral nodes. The stronger (weaker) superiority of the center in transportation leads to an agglomerated (dispersed) location equilibrium. Welfare analysis shows a tendency to excess agglomeration in equilibrium compared to that in the optimum.
We investigate the problem of computing the distribution function for the shortest and longest path lengths in a directed graph with random edge lengths. Specifically, when these lengths are uniformly distributed, the problem reduces to computing the volume of a polytope defined by the graph structure. We establish that the problem is #P-hard, even under the restricted condition that the random edge lengths are identically and independently distributed (i.i.d.) according to any continuous probability distribution with certain natural conditions, the local uniformity. This hardness result applies broadly: while the uniform distribution provides an essential case for the reduction, other distributions – such as exponential or normal – are similarly hard because they contain uniform distributions in every arbitrarily small interval. Furthermore, we show that the problem is contained within XP with respect to the treewidth k of the underlying undirected graph. For the specific case of i.i.d. uniform edge lengths, we present a novel dynamic programming algorithm that processes a tree decomposition by iteratively performing convolutions to propagate distribution functions. Our approach achieves a time complexity of n^O(k^2) for any fixed treewidth k.