Increasing and Decreasing Sequences in Fillings of Moon Polyominoes

We present an adaptation of jeu de taquin and promotion for arbitrary fillings of moon polyominoes. Using this construction we show various symmetry properties of such fillings taking into account the lengths of longest increasing and decreasing chains. In particular, we prove a conjecture of Jakob Jonsson. We also relate our construction to the one recently employed by Christian Krattenthaler, thus generalising his results.Comment: fixed typo

Promotion operator on rigged configurations of type A

Recently, the analogue of the promotion operator on crystals of type A under a generalization of the bijection of Kerov, Kirillov and Reshetikhin between crystals (or Littlewood--Richardson tableaux) and rigged configurations was proposed. In this paper, we give a proof of this conjecture. This shows in particular that the bijection between tensor products of type A_n^{(1)} crystals and (unrestricted) rigged configurations is an affine crystal isomorphism.Comment: 37 page

Application of reduced-set pareto-lipschitzian optimization to truss optimization

In this paper, a recently proposed global Lipschitz optimization algorithm Pareto-Lipschitzian Optimization with Reduced-set (PLOR) is further developed, investigated and applied to truss optimization problems. Partition patterns of the PLOR algorithm are similar to those of DIviding RECTangles (DIRECT), which was widely applied to different real-life problems. However here a set of all Lipschitz constants is reduced to just two: the maximal and the minimal ones. In such a way the PLOR approach is independent of any user-defined parameters and balances equally local and global search during the optimization process. An expanded list of other well-known DIRECT-type algorithms is used in investigation and experimental comparison using the standard test problems and truss optimization problems. The experimental investigation shows that the PLOR algorithm gives very competitive results to other DIRECT-type algorithms using standard test problems and performs pretty well on real truss optimization problems

The Hopf algebra of diagonal rectangulations

We define and study a combinatorial Hopf algebra dRec with basis elements indexed by diagonal rectangulations of a square. This Hopf algebra provides an intrinsic combinatorial realization of the Hopf algebra tBax of twisted Baxter permutations, which previously had only been described extrinsically as a sub Hopf algebra of the Malvenuto-Reutenauer Hopf algebra of permutations. We describe the natural lattice structure on diagonal rectangulations, analogous to the Tamari lattice on triangulations, and observe that diagonal rectangulations index the vertices of a polytope analogous to the associahedron. We give an explicit bijection between twisted Baxter permutations and the better-known Baxter permutations, and describe the resulting Hopf algebra structure on Baxter permutations.Comment: Very minor changes from version 1, in response to comments by referees. This is the final version, to appear in JCTA. 43 pages, 17 figure

Percolation on self-dual polygon configurations

Recently, Scullard and Ziff noticed that a broad class of planar percolation models are self-dual under a simple condition that, in a parametrized version of such a model, reduces to a single equation. They state that the solution of the resulting equation gives the critical point. However, just as in the classical case of bond percolation on the square lattice, self-duality is simply the starting point: the mathematical difficulty is precisely showing that self-duality implies criticality. Here we do so for a generalization of the models considered by Scullard and Ziff. In these models, the states of the bonds need not be independent; furthermore, increasing events need not be positively correlated, so new techniques are needed in the analysis. The main new ingredients are a generalization of Harris's Lemma to products of partially ordered sets, and a new proof of a type of Russo-Seymour-Welsh Lemma with minimal symmetry assumptions.Comment: Expanded; 73 pages, 24 figure

Multi-Sided Boundary Labeling

In the Boundary Labeling problem, we are given a set of $n$ points, referred to as sites, inside an axis-parallel rectangle $R$, and a set of $n$ pairwise disjoint rectangular labels that are attached to $R$ from the outside. The task is to connect the sites to the labels by non-intersecting rectilinear paths, so-called leaders, with at most one bend. In this paper, we study the Multi-Sided Boundary Labeling problem, with labels lying on at least two sides of the enclosing rectangle. We present a polynomial-time algorithm that computes a crossing-free leader layout if one exists. So far, such an algorithm has only been known for the cases in which labels lie on one side or on two opposite sides of $R$ (here a crossing-free solution always exists). The case where labels may lie on adjacent sides is more difficult. We present efficient algorithms for testing the existence of a crossing-free leader layout that labels all sites and also for maximizing the number of labeled sites in a crossing-free leader layout. For two-sided boundary labeling with adjacent sides, we further show how to minimize the total leader length in a crossing-free layout