相关论文: Polyominoes with nearly convex columns: An undirec…
We study a new class of polyominoes, called $p$-Fibonacci polyominoes, defined using $p$-Fibonacci words. We enumerate these polyominoes by applying generating functions to capture geometric parameters such as area, semi-perimeter, and the…
We give a complete description of the genus expansion of the one-cut solution to the generalized Penner model. The solution is presented in a form which allows us in a very straightforward manner to localize critical points and to…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
In 1980, Las Vergnas defined a notion of discrete convexity for oriented matroids, which Edelman subsequently related to the theory of anti-exchange closure functions and convex geometries. In this paper, we use generalized matroid activity…
Despite all advances in multi-dimensional hydrodynamics, investigations of stellar evolution and stellar pulsations still depend on one-dimensional computations. The present work devises an alternative to the mixing length theory or…
We introduce a general, efficient method to completely describe the topology of individual grains, bubbles, and cells in three-dimensional polycrystals, foams, and other multicellular microstructures. This approach is applied to a pair of…
We apply column generation to approximating complex structured objects via a set of primitive structured objects under either the cross entropy or L2 loss. We use L1 regularization to encourage the use of few structured primitive objects.…
Growth patterns generated by filamentous organisms (e.g. actinomycetes and fungi) involve spatial and temporal dynamics at different length scales. Several mathematical models have been proposed in the last thirty years to address these…
A convex optimization problem in conic form involves minimizing a linear functional over the intersection of a convex cone and an affine subspace. In some cases, it is possible to replace a conic formulation using a certain cone, with a…
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…
Kinetically constrained models (KCMs) are interacting particle systems introduced in the '80s by physicists to have accessible stochastic models with glassy-type dynamics. The key mechanism behind the complex evolution of these otherwise…
A convex-polynomial is a convex combination of the monomials $\{1, x, x^2, \ldots\}$. This paper establishes that the convex-polynomials on $\mathbb R$ are dense in $L^p(\mu)$ and weak$^*$ dense in $L^\infty(\mu)$, precisely when…
We refer here to the surprising construction made by Giuseppe Peano in 1890. He gave an example of a continuous function (called now the Peano curve) from the unit interval to the whole unit square. We show here the existence of a more…
Parallelogram polyominoes are a subclass of convex polyominoes in the square lattice that has been studied extensively in the literature. Recently congruence classes of convex polyominoes with respect to rotations and reflections have been…
Operator monotone functions, introduced by Lowner in 1934, are an important class of real-valued functions. They arise naturally in matrix and operator theory and have various applications in other branches of mathematics and related…
We will use different way (in this work) from the existing methods in the literature which speaking in the separation of convex sets was carried out by hyperplanes. We are examining the behavior of convex set which is the domain of convex…
We study the shape of inflated surfaces introduced in \cite{B1} and \cite{P1}. More precisely, we analyze profiles of surfaces obtained by inflating a convex polyhedron, or more generally an almost everywhere flat surface, with a symmetry…
We present a way of computing Kronecker coefficients that uses a new family of rational convex polytopes, called column-row polytopes. We give several different formulas for the computation. They are alternating sums of numbers of integer…
The one-point statistics of column density distributions of turbulent molecular cloud models are investigated and compared with observations. In agreement with the observations, the number N of pixels with surface density S is distributed…
We unify the study of quotients of matroids, polymatroids, valuated matroids and strong maps of submodular functions in the framework of Murota's discrete convex analysis. As a main result, we compile a list of ten equivalent…