Related papers: A combinatorial approach for solving certain neste…
In this work, we propose a simple but effective method to interpret black-box machine learning models globally. That is, we use a compact binary tree, the interpretation tree, to explicitly represent the most important decision rules that…
Gibbs sampling methods are standard tools to perform posterior inference for mixture models. These have been broadly classified into two categories: marginal and conditional methods. While conditional samplers are more widely applicable…
This review is an extended version of the Seoul ICM 2014 proceedings.It is a short overview of the "topological recursion", a relation appearing in the asymptotic expansion of many integrable systems and in enumerative problems. We recall…
In this paper, the problem of pattern avoidance in generalized non-crossing trees is studied. The generating functions for generalized non-crossing trees avoiding patterns of length one and two are obtained. Lagrange inversion formula is…
A three-point iterative method for solving scalar non-linear equations was selected and then adapted to solve systems of non-linear equations. Subsequently, by applying Taylor's theorem to functions of $\R^{n}$ in $\R^{n}$, it is shown that…
We consider a multivariate distributional recursion of sum-type as arising in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's bounding technique by estimating the…
$\lambda\upsilon$ is an extension of the $\lambda$-calculus which internalises the calculus of substitutions. In the current paper, we investigate the combinatorial properties of $\lambda\upsilon$ focusing on the quantitative aspects of…
In this paper, we study a class of generalized extensible beam equations with a superlinear nonlinearity \begin{equation*} \left\{ \begin{array}{ll} \Delta ^{2}u-M\left( \Vert \nabla u\Vert _{L^{2}}^{2}\right) \Delta u+\lambda V(x) u=f(…
We consider finite range Gibbs fields and provide a purely combinatorial proof of the exponential tree decay of semi--invariants, supposing that the logarithm of the partition function can be expressed as a sum of suitable local functions…
We study the following generalization of Roth's theorem for 3-term arithmetic progressions. For s>1, define a nontrivial s-configuration to be a set of s(s+1)/2 integers consisting of s distinct integers x_1,...,x_s as well as all the…
Recent research has proposed neural architectures for solving combinatorial problems in structured output spaces. In many such problems, there may exist multiple solutions for a given input, e.g. a partially filled Sudoku puzzle may have…
Following~\cite{Arkani-Hamed:2017thz}, we derive a recursion relation by applying a one-parameter deformation of kinematic variables for tree-level scattering amplitudes in bi-adjoint $\phi^3$ theory. The recursion relies on properties of…
We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the…
This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
We describe a bijection between $(k,k)$-Fuss-Schr\"oder paths of type $\lambda$ and certain rooted plane forests with $n(k+1)+2$ vertices. This yields a recursion which allows us to analytically enumerate the number of large…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
Consider the generalized iterated wreath product $S_{r_1}\wr \ldots \wr S_{r_k}$ of symmetric groups. We give a complete description of the traversal for the generalized iterated wreath product. We also prove an existence of a bijection…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
By considering the tiling of an $N$-board (a linear array of $N$ square cells of unit width) with new types of tile that we refer to as combs, we give a combinatorial interpretation of the product of two consecutive generalized Fibonacci…