PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays

In this paper we propose a simple and efficient data structure yielding a perfect hashing of quite general arrays. The data structure is named phorma, which is an acronym for perfectly hashable order restricted multidimensional array. Keywords: Perfect hash function, Digraph, Implicit enumeration, Nijenhuis-Wilf combinatorial family.Comment: 12 pages, 4 figures, 2 tables. Revised version. Submitted to Discrete Applied Mathematic

Enumeration of simple random walks and tridiagonal matrices

We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration of weighted paths of $n$ steps allows an easier combinatorial enumeration of the paths. It also seems promising for the theory of tridiagonal random matrices .Comment: several ref.and comments added, misprints correcte

Survey on Combinatorial Register Allocation and Instruction Scheduling

Register allocation (mapping variables to processor registers or memory) and instruction scheduling (reordering instructions to increase instruction-level parallelism) are essential tasks for generating efficient assembly code in a compiler. In the last three decades, combinatorial optimization has emerged as an alternative to traditional, heuristic algorithms for these two tasks. Combinatorial optimization approaches can deliver optimal solutions according to a model, can precisely capture trade-offs between conflicting decisions, and are more flexible at the expense of increased compilation time. This paper provides an exhaustive literature review and a classification of combinatorial optimization approaches to register allocation and instruction scheduling, with a focus on the techniques that are most applied in this context: integer programming, constraint programming, partitioned Boolean quadratic programming, and enumeration. Researchers in compilers and combinatorial optimization can benefit from identifying developments, trends, and challenges in the area; compiler practitioners may discern opportunities and grasp the potential benefit of applying combinatorial optimization

Vertically symmetric alternating sign matrices and a multivariate Laurent polynomial identity

In 2007, the first author gave an alternative proof of the refined alternating sign matrix theorem by introducing a linear equation system that determines the refined ASM numbers uniquely. Computer experiments suggest that the numbers appearing in a conjecture concerning the number of vertically symmetric alternating sign matrices with respect to the position of the first 1 in the second row of the matrix establish the solution of a linear equation system similar to the one for the ordinary refined ASM numbers. In this paper we show how our attempt to prove this fact naturally leads to a more general conjectural multivariate Laurent polynomial identity. Remarkably, in contrast to the ordinary refined ASM numbers, we need to extend the combinatorial interpretation of the numbers to parameters which are not contained in the combinatorial admissible domain. Some partial results towards proving the conjectured multivariate Laurent polynomial identity and additional motivation why to study it are presented as well

Probability around the Quantum Gravity. Part 1: Pure Planar Gravity

In this paper we study stochastic dynamics which leaves quantum gravity equilibrium distribution invariant. We start theoretical study of this dynamics (earlier it was only used for Monte-Carlo simulation). Main new results concern the existence and properties of local correlation functions in the thermodynamic limit. The study of dynamics constitutes a third part of the series of papers where more general class of processes were studied (but it is self-contained), those processes have some universal significance in probability and they cover most concrete processes, also they have many examples in computer science and biology. At the same time the paper can serve an introduction to quantum gravity for a probabilist: we give a rigorous exposition of quantum gravity in the planar pure gravity case. Mostly we use combinatorial techniques, instead of more popular in physics random matrix models, the central point is the famous $\alpha =-7/2$ exponent.Comment: 40 pages, 11 figure

An extensive English language bibliography on graph theory and its applications, supplement 1

Graph theory and its applications - bibliography, supplement