Related papers: Refined Catalan and Narayana cyclic sieving
If an object is very small in size compared with the wavelength of light, it does not scatter light efficiently. It is hence difficult to detect a very small object with light. We show using analytic theory as well as full wave numerical…
It is known that backward iterations of independent copies of a contractive random Lipschitz function converge almost surely under mild assumptions. By a sieving (or thinning) procedure based on adding to the functions time and space…
We interpret noncrossing partitions of type $B$ and type $D$ in terms of noncrossing partitions of type $A$. As an application, we get type-preserving bijections between noncrossing and nonnesting partitions of type $B$, type $C$ and type…
Convolutional Sparse Coding (CSC) is a well-established image representation model especially suited for image restoration tasks. In this work, we extend the applicability of this model by proposing a supervised approach to convolutional…
We study here slopes of periodicity of tilings. A tiling is of slope if it is periodic along direction but has no other direction of periodicity. We characterize in this paper the set of slopes we can achieve with tilings, and prove they…
The binary Constraint Satisfaction Problem (CSP) is to decide whether there exists an assignment to a set of variables which satisfies specified constraints between pairs of variables. A binary CSP instance can be presented as a labelled…
We begin by deriving a number of combinatorial identities satisfied by the $q$-super Catalan numbers. In particular, we extend some of the known combinatorial identities (Touchard, Koshy, Reed Dawson) to the $q$-super Catalan numbers. Next,…
Existing state-of-the-art salient object detection networks rely on aggregating multi-level features of pre-trained convolutional neural networks (CNNs). Compared to high-level features, low-level features contribute less to performance but…
We establish combinatorial interpretations of several identities for the Catalan and Fine numbers and, along the way, we present some new bijections of independent interest. Briefly, we show that C_{n} = 1/(n+1) Sum_{k} (n+1)choose(2k+1)…
This dissertation introduces executable refinement types, which refine structural types by semi-decidable predicates, and establishes their metatheory and accompanying implementation techniques. These results are useful for undecidable type…
Detection of circular objects in digital images is an important problem in several vision applications. Circle detection using randomized sampling has been developed in recent years to reduce the computational intensity. Randomized…
We address the problem of existence of refined (i.e., depending on a formal parameter) tropical enumerative invariants, and we present two new examples of a refined count of rational marked tropical curves. One of the new invariants counts…
We establish connections between silting and tilting objects in an abelian category $\mathcal{B}$ and those in a cleft extension $\mathcal{A}$ of $\mathcal{B}$, which provides a method for constructing more silting and tilting objects. Then…
We solve two open problems in Coxeter-Catalan combinatorics. First, we introduce a family of rational noncrossing objects for any finite Coxeter group, using the combinatorics of distinguished subwords. Second, we give a type-uniform proof…
Many studies have been carried out in order to increase the search efficiency of constraint satisfaction problems; among them, some make use of structural properties of the constraint network; others take into account semantic properties of…
The aim of this paper is to construct a new non-uniform corner-cutting (NUCC) subdivision scheme that improves the accuracy of the classical (stationary and nonstationary) methods. The refinement rules are formulated via the reproducing…
Assuming standard conjectures, we show that the canonical symmetrizing trace evaluated at powers of a Coxeter element produces rational Catalan numbers for irreducible spetsial complex reflection groups. This extends a technique used by…
Convolutional-deconvolution networks can be adopted to perform end-to-end saliency detection. But, they do not work well with objects of multiple scales. To overcome such a limitation, in this work, we propose a recurrent attentional…
Given a Bridgeland stability condition on a 2-Calabi--Yau category, we define a simplicial complex that encodes the Harder--Narasimhan filtrations of spherical objects. For 2-Calabi--Yau categories of type A, we relate this complex to the…
We study the pattern of activated trajectories in a double well system without detailed balance, in the weak noise limit. The pattern may contain cusps and other singular features, which are similar to the caustics of geometrical optics.…