Related papers: A repertoire for additive functionals of uniformly…
An attempt is described to extend the notion of Schur functions from Young diagrams to plane partitions. The suggestion is to use the recursion in the partition size, which is easily generalized and deformed. This opens a possibility to…
We establish basic results of complex function theory within certain algebras of holomorphic functions on coverings of Stein manifolds (such as algebras of Bohr's holomorphic almost periodic functions on tube domains or algebras of all…
Recently, Ivan Mihajlin and Alexander Smal proved a composition theorem of a universal relation and some function via so called xor composition, that is there exists some function $f:\{0,1\}^n \rightarrow \{0,1\}$ such that…
Using generating functions techniques we develop a relation between the Hausdorff and spectral dimension of trees with a unique infinite spine. Furthermore, it is shown that if the outgrowths along the spine are independent and identically…
We study the enumeration of closed walks of given length and algebraic area on the honeycomb lattice. Using an irreducible operator realization of honeycomb lattice moves, we map the problem to a Hofstadter-like Hamiltonian and show that…
Hash codes are a very efficient data representation needed to be able to cope with the ever growing amounts of data. We introduce a random forest semantic hashing scheme with information-theoretic code aggregation, showing for the first…
Alphabetic codes and binary search trees are combinatorial structures that abstract search procedures in ordered sets endowed with probability distributions. In this paper, we design new linear-time algorithms to construct alphabetic codes,…
We extend the classical coding of measured $\mathbb R$-trees by continuous excursion-type functions to c\`adl\`ag excursion-type functions through the notion of parametric representations. The main feature of this extension is its…
We prove that there is a one to one correspondence between the following three sets: idempotent functions on a set of size $n$, complete exceptional sequences of linear radical square zero Nakayama algebras of rank $n$ and rooted labeled…
We consider planar rooted random trees whose distribution is even for fixed height $h$ and size $N$ and whose height dependence is given by a power function $h^\alpha$. Defining the total weight for such trees of fixed size to be $Z_N$, a…
When combined properly, search techniques can reveal the full potential of sophisticated branching heuristics. We demonstrate this observation on the well-known class of random 3-SAT formulae. First, a new branching heuristic is presented,…
We explore a generating function trick which allows us to keep track of infinitely many statistics using finitely many variables, by recording their individual distributions rather than their joint distributions. Building on previous work…
We study properties of relative types of plurisubharmonic functions with respect to maximal plurisubharmonic weights. It is shown that they give a general form for upper semicontinuous, tropically additive functionals on plurisubharmonic…
Motivated by applications to low-rank matrix completion, we give a combinatorial characterization of the independent sets in the algebraic matroid associated to the collection of $m\times n$ rank-2 matrices and $n\times n$ skew-symmetric…
We extend the maximal unitarity method to amplitude contributions whose cuts define multidimensional algebraic varieties. The technique is valid to all orders and is explicitly demonstrated at three loops in gauge theories with any number…
Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If…
The current article completes our investigation of the hard-particle interaction by determining their distribution functionals. Beginning with a short review of the perturbation expansion of the free-energy functional, we derive two…
We tackle two long-standing problems related to re-expansions in heuristic search algorithms. For graph search, A* can require $\Omega(2^{n})$ expansions, where $n$ is the number of states within the final $f$ bound. Existing algorithms…
In this paper a functionality taxonomy for document search engines is proposed. It can be used to assess the features of a search engine, to position search engines relative to each other, or to select which search engine 'fits' a certain…
We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of…