Related papers: On the minimal teaching sets of two-dimensional th…
The geometry of Arithmetic Random Waves has been extensively investigated in the last fifteen years, starting from the seminal papers [RW08, ORW08]. In this paper we study the correlation structure among different functionals such as nodal…
We consider the asymptotic distribution of a cell in a 2 x ... x 2 contingency table as the fixed marginal totals tend to infinity. The asymptotic order of the cell variance is derived and a useful diagnostic is given for determining…
A general method is proposed for predicting the asymptotic percolation threshold of networks with bottlenecks, in the limit that the sub-net mesh size goes to zero. The validity of this method is tested for bond percolation on filled…
Barnette and Edelson have shown that there are finitely many minimal triangulations of a connected compact 2-manifold M. Similar finiteness results are obtained for cellular partial triangulations that satisfy various girth inequality…
An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its $2$-connectedness. This infimum thickness can be computed thanks to the fully…
We defined several functionals on the set of all triangulations of the finite system of points in d-space achieving global minimum on the Delaunay triangulation (DT). We consider a so called "parabolic" functional and prove it attains its…
We prove a Bernstein-type theorem for two-valued minimal graphs in the four-dimensional Euclidean space $\mathbf{R}^4$. This states that two-valued functions defined on the entire $\mathbf{R}^3$, and whose graph is a minimal surface, must…
A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a $2$-distance set, if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality exactly $2$. In…
We introduce real log canonical threshold and real jumping numbers for real algebraic functions. A real jumping number is a root of the $b$-function up to a sign if its difference with the minimal one is less than 1. The real log canonical…
A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. A function is a pebbling threshold for a sequence of graphs if a randomly chosen…
In this article we investigate the question of finding a network configuration of minimal length connecting three given points in the Heisenberg group. After proving existence of (possibly degenerate) minimal horizontal triods, we…
In this short note we construct unbounded families of minimal surfaces of general type with canonical map of degree 4 such that the limits of the slopes assume countably many different values among 6+2/3 and 8.
We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \emph{arbitrary} critical density cannot be…
The minimal degree of a permutation group $G$ is defined as the minimal number of non-fixed points of a non-trivial element of $G$. In this paper we show that if $G$ is a transitive permutation group of degree $n$ having no non-trivial…
The two-terminal conductance of a random flux model defined on a square lattice is investigated numerically at the band center using a transfer matrix method. Due to the chiral symmetry, there exists a critical point where the ensemble…
We study random 2-dimensional complexes in the Linial - Meshulam model and find torsion in their fundamental groups at various regimes. We find a simple algorithmically testable criterion for a subcomplex of a random 2-complex to be…
This paper focuses on the problem of topological equivalence of functions with isolated critical points on the boundary of a compact surface $M$ which are also isolated critical points of their restrictions to the boundary. This class of…
The trace algebra C(n,d) over a field of characteristic 0 is generated by all traces of products of d generic nxn matrices, n,d>1. Minimal sets of generators of C(n,d) are known for n=2 and n=3 for any d as well as for n=4 and n=5 and d=2.…
Line systems passing through the origin of the $d$ dimensional Euclidean space admitting exactly two distinct angles are called biangular. It is shown that the maximum cardinality of biangular lines is at least $2(d-1)(d-2)$, and this…
We discuss five simple functions on finite multisets of metric spaces. The first four are all metrics iff the underlying space is bounded and are complete metrics iff it is also complete. Two of them, and the fifth function, all generalise…