Related papers: Ascending Convex Polyominoes

Tropical refined invariants of toric surfaces constitute a fascinating interpolation between real and complex enumerative geometries via tropical geometry. They were originally introduced by Block and G\"ottsche, and further extended by…

We study the geometric and algebraic structure of Vandermonde cells, defined as images of the standard probability simplex under the Vandermonde map given by consecutive power sum polynomials. Motivated by their combinatorial equivalence to…

We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…

This study applies the binomial, k-binomial, rising k-binomial and falling k-binomial transforms to the modified k-Fibonacci-like sequence. Also, the Binet formulas and generating functions of the above mentioned four transforms are newly…

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…

In this note we study a certain graph polynomial arising from a special recursion. This recursion is a member of a family of four recursions where the other three recursions belong to the chromatic polynomial, the modified matching…

In this paper, we design and analyze a new family of adaptive subgradient methods for solving an important class of weakly convex (possibly nonsmooth) stochastic optimization problems. Adaptive methods that use exponential moving averages…

Although known lower bounds for the growth rate $\lambda$ of polyominoes, or Klarner's constant, are already close to the empirically estimated value $4.06$, almost no conceptual progress on upper bounds has occurred since the seminal work…

The problem of implementing a class of functions with particular conditions by using monotonic multilayer functions is considered. A genetic algorithm is used to create monotonic functions of a certain class, and these are implemented with…

The moduli space $M$ of semi-stable rank 2 bundles with trivial determinant over a complex curve carries involutions naturally associated to 2-torsion points on the Jacobian of the curve. For every lift of a 2-torsion point to a 4-torsion…

We infer upper and lower bounds on the exponential growth constants $\alpha(\Lambda)$, $\alpha_0(\Lambda)$, and $\beta(\Lambda)$ describing the large-$n$ behavior of, respectively, the number of acyclic orientations, acyclic orientations…

Let $k$ be a number field. We refine a construction of Mestre--Shioda to construct (infinite) families of hyperelliptic curves $X/{k}$ having a record number of rational points and record Mordell--Weil rank relative to the genus of $g$ of…

We study metric properties of the cone of homogeneous non-negative multivariate polynomials and the cone of sums of powers of linear forms, and the relationship between the two cones. We compute the maximum volume ellipsoid of the natural…

In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, such as the elementary, homogeneous, and…

We establish an alternative, ``perpendicular" collection of generating functions for the coefficients of Gaussian polynomials, $\begin{bmatrix}N+m\\m\end{bmatrix}_q$. We provide a general characterization of these perpendicular generating…

In this article, we prove that convex functions and log-convex functions obey certain general refinements that lead to several refinements and reverses of well known inequalities for matrices, including Young's inequality, Heinz inequality,…

In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for…

We prove that, in all dimensions d>=4, every simple open polygonal chain and every tree may be straightened, and every simple closed polygonal chain may be convexified. These reconfigurations can be achieved by algorithms that use…

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

We continue the work of Eriksen, Freij, and Wastlund [3], who study derangements that descend in blocks of prescribed lengths. We generalize their work to derangements that ascend in some blocks and descend in others. In particular, we…