相关论文: Polyominoes with nearly convex columns: An undirec…
The generation of curves and surfaces from given data is a well-known problem in Computer-Aided Design that can be approached using subdivision schemes. They are powerful tools that allow obtaining new data from the initial one by means of…
In applications throughout science and engineering one is often faced with the challenge of solving an ill-posed inverse problem, where the number of available measurements is smaller than the dimension of the model to be estimated. However…
We prove the uniform in space and time convergence of the scaled heights of large classes of deterministic growth models that are monotone and equivariant under translations by constants. The limits are characterized as the unique…
We classify all convex polyomino ideals which are linearly related or have a linear resolution. Convex stack polyominoes whose ideals are extremal Gorenstein are also classified. In addition, we characterize, in combinatorial terms, the…
We give the description of discretized moduli spaces (d.m.s.) $\Mcdisc$ introduced in \cite{Ch1} in terms of discrete de Rham cohomologies for moduli spaces $\Mgn$. The generating function for intersection indices (cohomological classes) of…
In the growth of bacterial colonies, a great variety of complex patterns are observed in experiments, depending on external conditions and the bacterial species. Typically, existing models employ systems of reaction-diffusion equations or…
Motivated by classical notions of bilinear matrix inequalities (BMIs) and partial convexity, this article investigates partial convexity for noncommutative functions. It is shown that noncommutative rational functions that are partially…
Real-world machine learning applications may require functions that are fast-to-evaluate and interpretable. In particular, guaranteed monotonicity of the learned function can be critical to user trust. We propose meeting these goals for…
Granular column collapse is a simple but important problem to the granular material community, due to its links to dynamics of natural hazards, such as landslides and pyroclastic flows, and many industrial situations, as well as its…
A permutomino of size n is a polyomino determined by a pair of permutations of size n+1, such that they differ in each position. In this paper, after recalling some enumerative results about permutominoes, we give a first algorithm for the…
A differentiable function is pseudoconvex if and only if its restrictions over straight lines are pseudoconvex. A differentiable function depending on one variable, defined on some closed interval $[a,b]$ is pseudoconvex if and only if…
In discrete convex analysis, the scaling and proximity properties for the class of L$^\natural$-convex functions were established more than a decade ago and have been used to design efficient minimization algorithms. For the larger class of…
A rep-tile is a polygon that can be dissected into smaller copies (of the same size) of the original polygon. A polyomino is a polygon that is formed by joining one or more unit squares edge to edge. These two notions were first introduced…
A hyperoval in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ is a set of $q+2$ points no three of which are collinear. Hyperovals have been studied extensively since the 1950s with the ultimate goal of establishing a complete…
We characterize when the level sets of a continuous quasi-monotone functional defined on a suitable convex subset of a normed space can be uniquely represented by a family of bounded continuous functionals. Furthermore, we investigate how…
In this paper, we consider various classes of polyiamonds that are animals residing on the triangular lattice. By careful analyses through certain layer-by-layer decompositions and cell pruning/growing arguments, we derive explicit forms…
Pippenger ([Pippenger, 1977]) showed the existence of $(6m,4m,3m,6)$-concentrator for each positive integer $m$ using a probabilistic method. We generalize his approach and prove existence of $(6m,4m,3m,5.05)$-concentrator (which is no…
We establish partial H\"older regularity for (local) generalised minimisers of variational problems involving strongly quasi-convex integrands of linear growth, where the full gradient is replaced by a first order homogeneous differential…
In this paper we give a review of the method of imsets introduced by Studeny (2005) from a geometric point of view. Elementary imsets span a polyhedral cone and its dual cone is the cone of supermodular functions. We review basic facts on…
This paper presents a study of generalized polyhedral convexity under basic operations on multifunctions. We address the preservation of generalized polyhedral convexity under sums and compositions of multifunctions, the domains and ranges…