What is the polyomino with the largest number $n$ of reflex (i.e., $270^\circ$) exterior angles that can fit in a $L \times L$ grid? How does $n$ scale with $L$?
2026-02-22 23:35:59.1771803359
Polyominoes with the most reflex exterior angles
95 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in EXTREMAL-COMBINATORICS
- Given N sets of partitions, find a partition such that it satisfies a criterion
- A Combinatorial Geometry Problem With A Solution Using Extremal Principle
- Trying to compute a limit for the Turán number
- Problem 2.2 from Jukna's "Extremal Combinatorics"
- Combinations help please
- Given a graph with n vertices, if it have more than $\frac{nt}{2}$ edges then there exists a simple path of length $t+1$.
- Number of steps the path-avoiding snail must take before a step size of $(2n - 1)/2^k$?
- Upper bound on cumulative power of system of limitedly intersecting subsets?
- Extremal combinatorics problem on graph matching
- Smallest $r$ for which there is an $r$-coloring of the grid wherein no two colors are adjacent more than once.
Related Questions in POLYOMINO
- Polyominoes with the most reflex exterior angles
- Smallest region that can contain all free $n$-ominoes.
- Can all convex $3n$-iamonds be tiled by $3$-iamonds?
- Is every "even" polyomino with one hole tileable by dominoes?
- Find a great strategy to a pentomino type game
- Can a $10\times 10$ square be entirely covered by 25 $T$-shape bricks?
- If we remove a strip polyomino from a strip polyomino, is the result tileable by dominoes?
- Where can I find out more about the nature of holes in plane regions?
- Are all polyominoes with even sides tileable by dominoes?
- Finding all rectangles with fault-free tilings of the P-pentomino
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
This is not an answer but it is at least a lower bound. If $L=3+4n$ where $n \in \Bbb N$, we can make polyominoes of the following structure:
In the examples above $n=0, 1 \text { and } 2$. The number of reflex exterior angles in these structures is given by the formula $$N=8n^2+14n+8 \tag{1}$$
I suspect this cannot be bettered.
EDIT
Some thoughts on an upper bound.
The only cells in a polyomino which can contribute to $N$ are the ones which are singly connected, which contribute $2$ angles, and those which are doubly connected (if the connections are in the form of an L), which contribute $1$ angle. To maximize $N$ we should therefore seek to maximize the number of Singly Connected Cells (SCC in the following).
An SCC needs space around it. In a corner of the grid it only needs $1$ adjacent space. On a side of the grid it needs $2$. In the interior of the grid it needs $5$.
For $L \gt 3$, it therefore seems to me that the SCCs cannot be placed closer to each other than as shown in the figure below:
If such structures were possible, then for L odd we have: $$N = 2 \left(\frac {L+1}{2}\right)^2$$ This then is an upper bound. If we insert $L=3+4n$ in the above formula we get: $$N=8n^2+16n+8$$ Comparing this to equation $(1)$ shows that the lower bound I found is very close to the upper bound.