In this note, we study certain sufficient conditions for a set of minimal klt pairs ( X, triangle) with kappa ( X, triangle) = dim( X ) - 1 to be bounded. ...
It is proved that the total length of any set of countably many rectifiable curves whose union meets all straight lines that intersect the unit square U is at least 2.00002. This is the first improvement on the lower bound of 2 known since 1964. A similar ...
Modifying the moduli of supporting convexity and supporting smoothness, we introduce new moduli for Banach spaces which occur, for example, as lengths of catheti of right-angled triangles (defined via so-called quasiorthogonality). These triangles have two ...
A graph G is a diameter graph in R-d if its vertex set is a finite subset in R-d of diameter 1 and edges join pairs of vertices a unit distance apart. It is shown that if a diameter graph G in R-4 contains the complete subgraph K on five vertices, then any ...
We present a setup that provides a partial UV-completion of the ghost inflation model up to a scale which can be almost as high as the Planck mass. This is achieved by coupling the inflaton to the Lorentz-violating sector described by the Einstein-aether t ...
It is known that for a convex body K in R-d of volume one, the expected volume of random simplices in K is minimized if K is an ellipsoid, and for d = 2, maximized if K is a triangle. Here we provide corresponding stability estimates. ...
The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opaque set or a barrier for that region. We consider the problem of computing the shortest ...
Let T be a triangulated surface given by the list of vertex-triples of its triangles, called rooms. A room-partitioning for T is a subset R of the rooms such that each vertex of T is in exactly one room in R. Given a room-partitioning R for T, the exchange ...
We show that the maximum total perimeter of k plane convex bodies with disjoint interiors lying inside a given convex body C is equal to , in the case when C is a square or an arbitrary triangle. A weaker bound is obtained for general plane convex bodies. ...
A diameter graph in is a graph whose set of vertices is a finite subset of and whose set of edges is formed by pairs of vertices that are at diameter apart. This paper is devoted to the study of different extremal properties of diameter graphs in and on a ...
In a seminal paper published in 1946, Erd ̋os initiated the investigation of the distribution of distances generated by point sets in metric spaces. In spite of some spectacular par- tial successes and persistent attacks by generations of mathe- maticians, ...
We study the effect of magnetocrystalline anisotropy on the magnetic configurations of La0.7Sr0.3MnO3 bar and triangle elements using photoemission electron microscopy imaging. The dominant remanent state is a low energy flux-closure state for both thin (1 ...
Downstream of hydroelectric storage dams, the rivers suffer from rapid, frequent and intense flow variations linked to the power production constraints. Subjected to this hydropeaking phenomenon, the fish population suffers from a known decline. In the res ...
A method is developed to compute the nonadiabatic coupling vectors (NACVs) between electronic ground and excited states as well as between any possible pair of excited states within the framework of linear response time-dependent density functional theory ...
We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces. Clustering, i.e., cyc ...