Related papers: Intervals in the greedy Tamari posets

We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix, Pach, and Pollack…

We investigate the first-passage properties of nearest-neighbor hopping on a finite interval with disordered hopping rates. We develop an approach that relies on the backward equation, in conjunction with probability generating functions,…

Garsia and Xin gave a linear algorithm for inverting the sweep map for Fuss rational Dyck paths in $D_{m,n}$ where $m=kn\pm 1$. They introduced an intermediate family $\mathcal{T}_n^k$ of certain standard Young tableau. Then inverting the…

To solve nonlinear problems, we construct two kinds of greedy capped nonlinear Kaczmarz methods by setting a capped threshold and introducing an effective probability criterion for selecting a row of the Jacobian matrix. The capped…

Multiple interval graphs are a well-known generalization of interval graphs introduced in the 1970s to deal with situations arising naturally in scheduling and allocation. A $d$-interval is the union of $d$ intervals on the real line, and a…

Recently, Kenyon and Wilson introduced Dyck tilings, which are certain tilings of the region between two Dyck paths. The enumeration of Dyck tilings is related with hook formulas for forests and the combinatorics of Hermite polynomials. The…

We study the asymptotical behaviour of iterates of piecewise contractive maps of the interval. It is known that Poincar\'e first return maps induced by some Cherry flows on transverse intervals are, up to topological conjugacy, piecewise…

We present algorithms for computing ranks and order statistics in the Farey sequence, taking time O (n^{2/3}). This improves on the recent algorithms of Pawlewicz [European Symp. Alg. 2007], running in time O (n^{3/4}). We also initiate the…

We construct positional numeral systems that work natively over nonderived polyadic $\left( m,n\right) $-rings whose addition takes $m$ arguments and multiplication takes $n$. In such rings, the length of an admissible additive word and a…

Improving a result of K\'arolyi, Pach and T\'oth, we construct an arrangement of $n$ segments in the plane with at most $n^{\log{8} / \log{169}}$ pairwise crossing or pairwise disjoint segments. We use the recursive method based on…

We review the parity anomaly of the massless Dirac fermion in $2+1$ dimensions from the Hamiltonian, as opposed to the path integral, point of view. We have two main goals for this note. First, we hope to make the parity anomaly more…

For any finite path $v$ on the square grid consisting of north and east unit steps, starting at (0,0), we construct a poset Tam$(v)$ that consists of all the paths weakly above $v$ with the same number of north and east steps as $v$. For…

We use Maynard's methods to show that there are bounded gaps between primes in the sequence $\{\lfloor n\alpha\rfloor\}$, where $\alpha$ is an irrational number of finite type. In addition, given a superlinear function $f$ satisfying some…

Periodic orbits (equivalence classes of closed paths up to cyclic shifts) play an important role in applications of graph theory. For example, they appear in the definition of the Ihara zeta function and exact trace formulae for the spectra…

The modified Farey sequence consists, at each level k, of rational fractions r_k^{(n)}, with n=1, 2, ...,2^k+1. We consider I_k^{(e)}, the total length of (one set of) alternate intervals between Farey fractions that are new (i.e., appear…

Consider a graph with n nodes and m edges, independent edge weights and lengths, and arbitrary distance demands for node pairs. The spanner problem asks for a minimum-weight subgraph that satisfies these demands via sufficiently short paths…

Given a fixed integer $n\geq 2$, we construct two new finite lattices that we call the cyclic Tamari lattice and the affine Tamari lattice. The cyclic Tamari lattice is a sublattice and a quotient lattice of the cyclic Dyer lattice, which…

Continued fractions are linked to Stern's diatomic sequence 0,1,1,2,1,3,2,3,1,4,... (given by the recursion relation a_2n=a_n and a_{2n+1} = a_n + a_{n+1}, where a_0=0 and a_1=1), which has long been known. Using a particular…

Garling sequence spaces admit a renorming with respect to which their standard unit vector basis is 1-greedy. We also discuss some additional properties of these Banach spaces related to uniform convexity and superreflexivity. In…

Although the basic idea behind the concept of a greedy basis had been around for some time, the formal development of a theory of greedy bases was initiated in 1999 with the publication of the article [S.~V.~Konyagin and V.~N.~Temlyakov, A…