Related papers: Small Littlewood-Richardson coefficients
We provide direct proofs of product and coproduct formulae for Schur functions where the coefficients (Littlewood--Richardson coefficients) are defined as counting puzzles. The product formula includes a second alphabet for the Schur…
This work studies the remarkable relationships that hold among certain m-tuples of the Garsia-Haiman modules $ {\bf M}_\mu$ and corresponding elements of the Macdonald basis. We recall that ${\bf M}_\mu$ is defined for a partition $\mu\part…
We provide theoretical insights around the cutwidth of a graph and the One-Sided Crossing Minimization (OSCM) problem. OSCM was posed in the Parameterized Algorithms and Computational Experiments Challenge 2024, where the cutwidth of the…
We present an $O(\log d + \log\log_{m/n} n)$-time randomized PRAM algorithm for computing the connected components of an $n$-vertex, $m$-edge undirected graph with maximum component diameter $d$. The algorithm runs on an ARBITRARY CRCW…
In this paper, we discuss the algorithm engineering aspects of an O(n^2)-time algorithm [6] for computing a minimum-area convex polygon that intersects a set of n isothetic line segments.
One of the key results in Robertson and Seymour's seminal work on graph minors is the Grid-Minor Theorem (also called the Excluded Grid Theorem). The theorem states that for every grid $H$, every graph whose treewidth is large enough…
We present a deterministic algorithm which, given a graph G with n vertices and an integer 1<m < n, computes in n^{O(ln m)} time the sum of weights w(S) over all m-subsets S of the set of vertices of G, where w(S)=exp{gamma t m +O(1/m)}…
Brambles were introduced as the dual notion to treewidth, one of the most central concepts of the graph minor theory of Robertson and Seymour. Recently, Grohe and Marx showed that there are graphs G, in which every bramble of order larger…
A cubic partition consists of partition pairs $(\lambda,\mu)$ such that $\vert\lambda\vert+\vert\mu\vert=n$ where $\mu$ involves only even integers but no restriction is placed on $\lambda$. This paper initiates the notion of generalized…
We investigate the parameterized complexity of the Isometric Path Partition problem when parameterized by the treewidth ($\mathrm{tw}$) of the input graph, arguably one of the most widely studied parameters. Courcelle's theorem shows that…
The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in designing efficient algorithms. We introduce a new notion…
We present two new and efficient algorithms for computing all-pairs shortest paths. The algorithms operate on directed graphs with real (possibly negative) weights. They make use of directed path consistency along a vertex ordering d. Both…
This paper introduces the foliage partition, an easy-to-compute LC-invariant for graph states, of computational complexity $\mathcal{O}(n^3)$ in the number of qubits. Inspired by the foliage of a graph, our invariant has a natural graphical…
A connected partition is a partition of the vertices of a graph into sets that induce connected subgraphs. Such partitions naturally occur in many application areas such as road networks, and image processing. We consider Balanced Connected…
A fundamental question that shrouds the emergence of massively parallel computing (MPC) platforms is how can the additional power of the MPC paradigm be leveraged to achieve faster algorithms compared to classical parallel models such as…
We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of…
Let $\Gamma$ be a graph equipped with a Markov operator $P$. We introduce discrete fractional Littlewood-Paley square functionals and prove their $L^p$-boundedness under various geometric assumptions on $\Gamma$.
In Baraka's paper [2], he obtained the Littlewood-Paley characterization of Campanato spaces $L^{2,\lambda}$ and introduced $\mathcal {L}^{p,\lambda,s}$ spaces. He showed that $\mathcal…
The famous Padberg-Rao separation algorithm for b-matching polyhedra can be implemented to run in O(n^2m log(n^2/m)) time in the uncapacitated case, and in O(nm^2 log(n^2/m)) time in the capacitated case (where n is the number of vertices…
A consequence of work of Klyachko and of Knutson-Tao is the Horn recursion to determine when a Littlewood-Richardson coefficient is non-zero. Briefly, a Littlewood-Richardson coefficient is non-zero if and only if it satisfies a collection…