English
Related papers

Related papers: Modem Illumination of Monotone Polygons

200 papers

In the monomer-polymer model, a linear rigid polymer covers $k$ adjacent lattice sites, with no lattice site occupied by more than one polymer. The polymers are called $k$-mers, and those unoccupied lattice sites are called monomers. The…

Combinatorics · Mathematics 2026-05-19 Yong Kong

We show that every (possibly unbounded) convex polygon $P$ in $R^2$ with $m$ edges can be represented by inequalities $p_1 \ge 0,...,p_n \ge 0,$ where the $p_i$'s are products of at most $k$ affine functions each vanishing on an edge of $P$…

Metric Geometry · Mathematics 2010-02-05 Gennadiy Averkov , Christian Bey

Let $K$ be a convex pentagon in the plane and let $K_1$ be the pentagon bounded by the diagonals of $K$. It has been conjectured that the maximum of the ratio between the areas of $K_1$ and $K$ is reached when $K$ is an affine regular…

History and Overview · Mathematics 2018-12-20 Jacqueline Cho , Dan Ismailescu , Yiwon Kim , Andrew Woojong Lee

We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…

Optimization and Control · Mathematics 2024-04-03 Bernd Mulansky , Andreas Potschka

We consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves, with edge or mobile guards. Our focus is on piecewise-convex polygons, i.e., polygons that are locally convex, except possibly…

Computational Geometry · Computer Science 2011-03-01 Menelaos I. Karavelas

We study the Cooperative Guarding problem for polygons with holes in a mobile multi-agents setting. Given a set of agents, initially deployed at a point in a polygon with $n$ vertices and $h$ holes, we require the agents to collaboratively…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-01 John Augustine , Srikkanth Ramachandran

Given a set of $n\geq 1$ unit disk robots in the Euclidean plane, we consider the fundamental problem of providing mutual visibility to them: the robots must reposition themselves to reach a configuration where they all see each other. This…

Computational Geometry · Computer Science 2026-02-18 Rusul J. Alsaedi , Joachim Gudmundsson , André van Renssen

In this work we study the space S(n) of positively oriented, simple n-gons with labeled vertices up to oriented similarity and M(n) the moduli space of simple n-gons as a quotient of S(n). We give a local description of S(n) and M(n) around…

Differential Geometry · Mathematics 2023-03-28 Ahtziri González , Manuel Sedano-Mendoza

Boolean-width is a recently introduced graph parameter. Many problems are fixed parameter tractable when parametrized by boolean-width, for instance "Minimum Weighted Dominating Set" (MWDS) problem can be solved in $O^*(2^{3k})$ time given…

Discrete Mathematics · Computer Science 2011-07-11 Rémy Belmonte , Martin Vatshelle

For any sequence of positive integers j_1 < j_2 < ... < j_n, the k-tuples (j_i,j_{i + 1},...,j_{i + k-1}), i=1, 2,..., n - k+1, are said to form a monotone path of length n. Given any integers n\ge k\ge 2 and q\ge 2, what is the smallest…

Combinatorics · Mathematics 2014-02-26 Jacob Fox , Janos Pach , Benny Sudakov , Andrew Suk

Optical entanglement is a key requirement for many quantum communication protocols. Conventionally entanglement is formed between two distinct beams, with the quantum correlations being measured at separate locations. We show entanglement…

Quantum Physics · Physics 2008-12-31 J. Janousek , K. Wagner , J-F. Morizur , N. Treps , P. K. Lam , C. C. Harb , H-A. Bachor

This paper deals with the accomplishment of total area coverage of an arbitrary region using sensors with a finite sensing radius of rs. For a given region, we aim to obtain a deterministic placement of sensors which, apart from ensuring…

Networking and Internet Architecture · Computer Science 2010-01-27 Shyam M , Anurag Kumar

We generalize the well-known "12" and "24" Theorems for reflexive polytopes of dimension 2 and 3 to any smooth reflexive polytope. Our methods apply to a wider category of objects, here called reflexive GKM graphs, that are associated with…

Combinatorics · Mathematics 2016-04-04 Leonor Godinho , Frederik von Heymann , Silvia Sabatini

Infinite families of multi-indexed orthogonal polynomials are discovered as the solutions of exactly solvable one-dimensional quantum mechanical systems. The simplest examples, the one-indexed orthogonal polynomials, are the infinite…

Mathematical Physics · Physics 2015-05-28 Satoru Odake , Ryu Sasaki

Let $K$ be a convex body in $\Bbb R^{d}$ and $K_{t}$ its floating bodies. There is a polytope with at most $n$ vertices that satisfies $$ K_{t} \subset P_{n} \subset K $$ where $$ n \leq e^{16d} \frac{vol_{d}(K \setminus K_{t})}{t\…

Metric Geometry · Mathematics 2015-06-26 Carsten Schütt

This is the first in a series of papers in which we describe explicit structural properties of spaces of diagonal rectangular harmonic polynomials in $k$ sets of $n$ variables, both as $GL_k$-modules and $S_n$-modules, as well as some of…

Combinatorics · Mathematics 2020-03-18 François Bergeron

Conway and Lagarias showed that certain roughly triangular regions in the hexagonal grid cannot be tiled by shapes Thurston later dubbed tribones. Here we study a two-parameter family of roughly hexagonal regions in the hexagonal grid and…

Combinatorics · Mathematics 2023-07-10 Jesse Kim , James Propp

Solitons are non-dispersing localized waves that occur in diverse physical settings. A variety of optical solitons have been observed, but versions that involve both spatial and temporal degrees of freedom are rare. Optical fibers designed…

Optics · Physics 2015-06-15 William H. Renninger , Frank W. Wise

For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…

Combinatorics · Mathematics 2017-01-23 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

The Hankel determinant representations for the partition function and boundary correlation functions of the six-vertex model with domain wall boundary conditions are investigated by the methods of orthogonal polynomial theory. For specific…

Mathematical Physics · Physics 2009-11-23 F. Colomo , A. G. Pronko
‹ Prev 1 4 5 6 7 8 10 Next ›