How (Not) to Cut Your Cheese

It is well known that a line can intersect at most 2n−1 unit squares of the n × n chessboard. Here we consider the three-dimensional version: how many unit cubes of the 3-dimensional cube [0,n]3 can a hyperplane intersect

Maximizing the Total Resolution of Graphs

A major factor affecting the readability of a graph drawing is its resolution. In the graph drawing literature, the resolution of a drawing is either measured based on the angles formed by consecutive edges incident to a common node (angular resolution) or by the angles formed at edge crossings (crossing resolution). In this paper, we evaluate both by introducing the notion of "total resolution", that is, the minimum of the angular and crossing resolution. To the best of our knowledge, this is the first time where the problem of maximizing the total resolution of a drawing is studied. The main contribution of the paper consists of drawings of asymptotically optimal total resolution for complete graphs (circular drawings) and for complete bipartite graphs (2-layered drawings). In addition, we present and experimentally evaluate a force-directed based algorithm that constructs drawings of large total resolution

Tverberg's theorem is 50 Years Old: A survey

This survey presents an overview of the advances around Tverberg's theorem, focusing on the last two decades. We discuss the topological, linear-algebraic, and combinatorial aspects of Tverberg's theorem and its applications. The survey contains several open problems and conjectures. © 2018 American Mathematical Society

Tverberg Plus Minus

We prove a Tverberg type theorem: Given a set A Rd in general position with | A| = (r- 1) (d+ 1) + 1 and k∈ { 0 , 1 , … , r- 1 } , there is a partition of A into r sets A1, … , Ar (where | Aj| ≤ d+ 1 for each j) with the following property. There is a unique zj=1raffAj and it can be written as an affine combination of the element in Aj: z=∑x∈Ajα(x)x for every j and exactly k of the coefficients α(x) are negative. The case k= 0 is Tverberg’s classical theorem. © 2018, Springer Science+Business Media, LLC, part of Springer Nature

Cutting the same fraction of several measures

We study some measure partition problems: Cut the same positive fraction of $d+1$ measures in $\mathbb R^d$ with a hyperplane or find a convex subset of $\mathbb R^d$ on which $d+1$ given measures have the same prescribed value. For both problems positive answers are given under some additional assumptions.Comment: 7 pages 2 figure

Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints

We introduce a new structure for a set of points in the plane and an angle $\alpha$, which is similar in flavor to a bounded-degree MST. We name this structure $\alpha$-MST. Let $P$ be a set of points in the plane and let $0 < \alpha \le 2\pi$ be an angle. An $\alpha$-ST of $P$ is a spanning tree of the complete Euclidean graph induced by $P$, with the additional property that for each point $p \in P$, the smallest angle around $p$ containing all the edges adjacent to $p$ is at most $\alpha$. An $\alpha$-MST of $P$ is then an $\alpha$-ST of $P$ of minimum weight. For $\alpha < \pi/3$, an $\alpha$-ST does not always exist, and, for $\alpha \ge \pi/3$, it always exists. In this paper, we study the problem of computing an $\alpha$-MST for several common values of $\alpha$. Motivated by wireless networks, we formulate the problem in terms of directional antennas. With each point $p \in P$, we associate a wedge $W_p$ of angle $\alpha$ and apex $p$. The goal is to assign an orientation and a radius $r_p$ to each wedge $W_p$, such that the resulting graph is connected and its MST is an $\alpha$-MST. (We draw an edge between $p$ and $q$ if $p \in W_q$, $q \in W_p$, and $|pq| \le r_p, r_q$.) Unsurprisingly, the problem of computing an $\alpha$-MST is NP-hard, at least for $\alpha=\pi$ and $\alpha=2\pi/3$. We present constant-factor approximation algorithms for $\alpha = \pi/2, 2\pi/3, \pi$. One of our major results is a surprising theorem for $\alpha = 2\pi/3$, which, besides being interesting from a geometric point of view, has important applications. For example, the theorem guarantees that given any set $P$ of $3n$ points in the plane and any partitioning of the points into $n$ triplets, one can orient the wedges of each triplet {\em independently}, such that the graph induced by $P$ is connected. We apply the theorem to the {\em antenna conversion} problem

Характеристика сили нервових процесів у плавців

OBJECTIVE: Higher levels of the novel inflammatory marker pentraxin 3 (PTX3) predict cardiovascular mortality in patients with chronic kidney disease (CKD). Yet, whether PTX3 predicts worsening of kidney function has been less well studied. We therefore investigated the associations between PTX3 levels, kidney disease measures and CKD incidence. METHODS: Cross-sectional associations between serum PTX3 levels, urinary albumin/creatinine ratio (ACR) and cystatin C-estimated glomerular filtration rate (GFR) were assessed in two independent community-based cohorts of elderly subjects: the Prospective Investigation of the Vasculature in Uppsala Seniors (PIVUS, n = 768, 51% women, mean age 75 years) and the Uppsala Longitudinal Study of Adult Men (ULSAM, n = 651, mean age 77 years). The longitudinal association between PTX3 level at baseline and incident CKD (GFR &lt;60 mL( ) min(-1)  1.73 m(-) ²) was also analysed (number of events/number at risk: PIVUS 229/746, ULSAM 206/315). RESULTS: PTX3 levels were inversely associated with GFR [PIVUS: B-coefficient per 1 SD increase -0.16, 95% confidence interval (CI) -0.23 to -0.10, P &lt; 0.001; ULSAM: B-coefficient per 1 SD increase -0.09, 95% CI -0.16 to -0.01, P &lt; 0.05], but not ACR, after adjusting for age, gender, C-reactive protein and prevalent cardiovascular disease in cross-sectional analyses. In longitudinal analyses, PTX3 levels predicted incident CKD after 5 years in both cohorts [PIVUS: multivariable odds ratio (OR) 1.21, 95% CI 1.01-1.45, P &lt; 0.05; ULSAM: multivariable OR 1.37, 95% CI 1.07-1.77, P &lt; 0.05]. CONCLUSIONS: Higher PTX3 levels are associated with lower GFR and independently predict incident CKD in elderly men and women. Our data confirm and extend previous evidence suggesting that inflammatory processes are activated in the early stages of CKD and drive impairment of kidney function. Circulating PTX3 appears to be a promising biomarker of kidney disease

Algorithms for Colourful Simplicial Depth and Medians in the Plane

The colourful simplicial depth of a point x in the plane relative to a configuration of n points in k colour classes is exactly the number of closed simplices (triangles) with vertices from 3 different colour classes that contain x in their convex hull. We consider the problems of efficiently computing the colourful simplicial depth of a point x, and of finding a point, called a median, that maximizes colourful simplicial depth. For computing the colourful simplicial depth of x, our algorithm runs in time O(n log(n) + k n) in general, and O(kn) if the points are sorted around x. For finding the colourful median, we get a time of O(n^4). For comparison, the running times of the best known algorithm for the monochrome version of these problems are O(n log(n)) in general, improving to O(n) if the points are sorted around x for monochrome depth, and O(n^4) for finding a monochrome median.Comment: 17 pages, 8 figure

Технологические решения для строительства разведочной вертикальной скважины глубиной 2750 метров на нефтяном месторождении (ХМАО)

Технологические решения для строительства разведочной вертикальной скважины глубиной 2750 метров на нефтяном месторождении (ХМАО).Technological solutions for the construction of an exploration vertical well with a depth of 2,750 meters at the oil field (KhMAO)