Related papers: Ascending Convex Polyominoes
Poincar\'e profiles are a family of analytically defined coarse invariants, which can be used as obstructions to the existence of coarse embeddings between metric spaces. In this paper we calculate the Poincar\'e profiles of all connected…
In this paper, we enumerate two families of polycubes, the directed plateau polycubes and the plateau polycubes, with respect to the width and a new parameter, the Lateral Area. We give an explicit formula and the generating function for…
Height functions of growing random surfaces are often conjectured to be superconcentrated, meaning that their variances grow sublinearly in time. This article introduces a new concept, called subroughness, meaning that there exist two…
Conic optimization has recently emerged as a powerful tool for designing tractable and guaranteed algorithms for non-convex polynomial optimization problems. On the one hand, tractability is crucial for efficiently solving large-scale…
We construct a generating functional for the exact evalutation of a coherent representation of spin network amplitudes. This generating functional is defined for arbitrary graphs and depends only on a pair of spinors for each edge. The…
We introduce a method for analyzing the convex hull of a set in non-positively curved piecewise Euclidean polygonal complexes and we apply this method to prove that, with the usual action of Fm x Zn on the metric product of the Cayley graph…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…
We investigate the evolutionary dynamics of an idealised model for the robust self-assembly of two-dimensional structures called polyominoes. The model includes rules that encode interactions between sets of square tiles that drive the…
Two dimensional steepest descent curves (SDC) for a quasi convex family are considered; the problem of their extensions (with constraints) outside of a convex body $K$ is studied. It is shown that possible extensions are constrained to lie…
Integral representations for continuous polynomial local functionals on convex functions are established in terms of a finite family of polynomials. This result is obtained by approximation from a classification of the dense subspace of…
The paper considers the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation scenarios, and is a special case of an optimization of a…
The technique of $Q$-polinomials are used to derive the $w$- constraints in the two-matrix and Kontsevich-like model at finite $N$. These constraints are closed and form Lie algebra. They are associated with the matrices, $\lambda…
Starting from some considerations we make about the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that…
This work introduces and systematically studies a new convex cone of PCOP (pairwise copositive). We establish that this cone is dual to the cone of PCP (pairwise completely positive) and, critically, provides a complete characterization for…
Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…
The Brenke type generating functions are the polynomial generating functions of the form $$\sum_{n=0}^{\infty}{P_n(x )\over n!}t^n=A(t)B(xt), $$ where $A$ and $B$ are two formal power series subject to the conditions…
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
In this paper, we propose a novel formulation to extend CNNs to two-dimensional (2D) manifolds using orthogonal basis functions, called Zernike polynomials. In many areas, geometric features play a key role in understanding scientific…
A combinatorial neural code $\mathscr C\subseteq 2^{[n]}$ is convex if it arises as the intersection pattern of convex open subsets of $\mathbb R^d$. We relate the emerging theory of convex neural codes to the established theory of oriented…
Let ${\sf G}$ be a locally compact group with polynomial growth of order $d$, a polynomial weight $\nu$ on ${\sf G}$ and a Fell bundle $\mathscr C\overset{q}{\to}{\sf G}$. We study the Banach $^*$-algebras $L^1({\sf G}\,\vert\,\mathscr C)$…