Related papers: An angle between intermediate subfactors and its r…
The degree-based entropy of a graph is defined as the Shannon entropy based on the information functional that associates the vertices of the graph with the corresponding degrees. In this paper, we study extremal problems of finding the…
A concept of implicit links for Complex Networks has been defined and a new value - cohesion factor, which allows to evaluate numerically the presence of such connection between any two nodes, has been introduced. We introduce a…
We introduce a new measure of interdependence among the components of a random vector along the main diagonal of the vector copula, i.e. along the line $u_{1}=\ldots=u_{J}$, for $\left(u_{1},\ldots,u_{J}\right)\in\left[0,1\right]^{J}$. Our…
Kalfagianni and Lee found two-sided bounds for the crosscap number of an alternating link in terms of certain coefficients of the Jones polynomial. We show here that we can find similar two-sided bounds for the crosscap number of Conway…
We prove a lower bound of $\Omega (d^{3/2} \cdot (2/\sqrt{3})^d)$ on the kissing number in dimension $d$. This improves the classical lower bound of Chabauty, Shannon, and Wyner by a linear factor in the dimension. We obtain a similar…
Ropelength and embedding thickness are related measures of geometric complexity of classical knots and links in Euclidean space. In their recent work, Freedman and Krushkal posed a question regarding lower bounds for embedding thickness of…
We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.
We obtain an upper bound on the lowest magnetic Neumann eigenvalue of a bounded, convex, smooth, planar domain with moderate intensity of the homogeneous magnetic field. This bound is given as a product of a purely geometric factor…
It is a well known phenomenon that many classical minimal surfaces in Euclidean space also exist with higher dihedral symmetry. More precisely, these surfaces are solutions to free boundary problems in a wedge bounded by two vertical planes…
The biplanar crossing number of a graph $G$ is the minimum number of crossings over all possible drawings of the edges of $G$ in two disjoint planes. We present new bounds on the biplanar crossing number of complete graphs and complete…
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear…
Let $f$ be a newform of prime level $p$ with any central character $\chi\, (\bmod\, p)$, and let $g$ be a fixed cusp form or Eisenstein series for $\hbox{SL}_{2}(\mathbb{Z})$. We prove the subconvexity bound: for any $\varepsilon>0$,…
We show that the short-scale elastic distortions that are excited in the vicinity of the joint between different lipidic membrane domains (at a scale of \~10 nm) may produce a "crease" from the point of view of the standard elastic…
We consider a bipartite distance-regular graph $G$ with diameter at least 4 and valency at least 3. Fix a vertex of $G$ and let $T$ denote the corresponding subconstituent algebra. We give a detailed description of a certain type of…
We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…
We give exponential upper bounds for $P(S \le k)$, in particular $P(S=0)$, where $S$ is a sum of indicator random variables that are positively associated. These bounds allow, in particular, a comparison with the independent case. We give…
In this short note we derive, for bounded domains, an upper bound for a Friedrichs type constant in a weighted Friedrichs type inequality. This upper bound generalizes a well known upper bound of the Friedrichs constant. This upper bound is…
We prove a sharp upper bound on the number of shortest cycles contained inside any connected graph in terms of its number of vertices, girth, and maximal degree. Equality holds only for Moore graphs, which gives a new characterization of…
This paper is devoted to studying difference indices of quasi-regular difference algebraic systems. We give the definition of difference indices through a family of pseudo-Jacobian matrices. Some properties of difference indices are proved.…
We describe all subdirectly irreducible medial quandles. We show that they fall within one of four disjoint classes. In particular, in the finite case they are either connected (and therefore Alexander quandles) or reductive. Moreover, we…