Related papers: The infinite partition of a line segment and multi…
We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…
We discuss the definition and measurability questions of random fractals and find under certain conditions a formula for upper and lower Minkowski dimensions. For the case of a random self-similar set we obtain the packing dimension.
The dissociation number ${\rm diss}(G)$ of a graph $G$ is the maximum order of a set of vertices of $G$ inducing a subgraph that is of maximum degree at most $1$. Computing the dissociation number of a given graph is algorithmically hard…
By using the independence structure of points following a determinantal point process, we study the radii of the spherical ensemble, the truncation of the circular unitary ensemble and the product ensemble with parameter n and k. The…
Let $G=(V, E)$ be a graph where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say $A$ \emph{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$. A vertex…
Sequences diverge either because they head off to infinity or because they oscillate. Part 1 constructs a non-Archimedean framework of infinite numbers that is large enough to contain asymptotic limit points for non-oscillating sequences…
This paper gives a complete characterization of infinitely divisible semimartingales, i.e., semimartingales whose finite dimensional distributions are infinitely divisible. An explicit and essentially unique decomposition of such…
We have developed a simulation technique that uses non-linear finite element analysis and elastic fracture mechanics to compute physically plausible motion for three-dimensional, solid objects as they break, crack, or tear. When these…
We consider partitions of a point set into two parts, and the lengths of the minimum spanning trees of the original set and of the two parts. If $w(P)$ denotes the length of a minimum spanning tree of $P$, we show that every set $P$ of $n…
We study the \emph{multiterminal cut} problem, which, given an $n$-vertex graph whose edges are integer-weighted and a set of terminals, asks for a partition of the vertex set such that each terminal is in a distinct part, and the total…
We consider a random interval splitting process, in which the splitting rule depends on the empirical distribution of interval lengths. We show that this empirical distribution converges to a limit almost surely as the number of intervals…
We calculate the spectral dimension of a wide class of tree-like fractals by solving the random walk problem through a new analytical technique, based on invariance under generalized cutting-decimation transformations. These fractals are…
We apply the Principle of Maximum Entropy to the study of a general class of deterministic fractal sets. The scaling laws peculiar to these objects are accounted for by means of a constraint concerning the average content of information in…
Following \cite{Visintin}, we exploit the fractional perimeter of a set to give a definition of fractal dimension for its measure theoretic boundary. We calculate the fractal dimension of sets which can be defined in a recursive way and we…
Let $X$ be a finite collection of sets. We count the number of ways a disjoint union of $n-1$ subsets in $X$ is a set in $X$, and estimate this number from above by $|X|^{c(n)}$ where $$ c(n)=\left(1-\frac{(n-1)\ln (n-1)}{n\ln n}…
We introduce a new family of models for growing networks. In these networks new edges are attached preferentially to vertices with higher number of connections, and new vertices are created by already existing ones, inheriting part of their…
In this note, we obtain a formula which leads to a practical and efficient method to calculate the number of partitions of n into parts not divisible by m for given natural numbers n and m.
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in general. In this paper we present an efficient solution for the homogeneous version of this problem; i.e. where the elements in each subset add…
We consider the hierarchic tree Random Energy Model with continuous branching and calculate the moments of the corresponding partition function. We establish the multifractal properties of those moments. We derive formulas for the normal…
We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and…