Do you want to publish a course? Click here

Convex fair partitions into an arbitrary number of pieces

347   0   0.0 ( 0 )
 Added by Roman Karasev
 Publication date 2018
  fields
and research's language is English




Ask ChatGPT about the research

We prove that any convex body in the plane can be partitioned into $m$ convex parts of equal areas and perimeters for any integer $mge 2$; this result was previously known for prime powers $m=p^k$. We also discuss possible higher-dimensional generalizations and difficulties of extending our technique to equalizing more than one non-additive function.



rate research

Read More

We prove that, for any positive integer $m$, a segment may be partitioned into $m$ possibly degenerate or empty segments with equal values of a continuous function $f$ of a segment, assuming that $f$ may take positive and negative values, but its value on degenerate or empty segments is zero.
Monskys theorem from 1970 states that a square cannot be dissected into an odd number of triangles of the same area, but it does not give a lower bound for the area differences that must occur. We extend Monskys theorem to constrained framed maps; based on this we can apply a gap theorem from semi-algebraic geometry to a polynomial area difference measure and thus get a lower bound for the area differences that decreases doubly-exponentially with the number of triangles. On the other hand, we obtain the first superpolynomial upper bounds for this problem, derived from an explicit construction that uses the Thue-Morse sequence.
98 - R. Brak , W. Galleas 2012
Osculating paths are sets of directed lattice paths which are not allowed to cross each other or have common edges, but are allowed to have common vertices. In this work we derive a constant term formula for the number of such lattice paths by solving a set of simultaneous difference equations.
For an $r$-tuple $(gamma_1,ldots,gamma_r)$ of special orthogonal $dtimes d$ matrices, we say the Euclidean $(d-1)$-dimensional sphere $S^{d-1}$ is $(gamma_1,ldots,gamma_r)$-divisible if there is a subset $Asubseteq S^{d-1}$ such that its translations by the rotations $gamma_1,ldots,gamma_r$ partition the sphere. Motivated by some old open questions of Mycielski and Wagon, we investigate the version of this notion where the set $A$ has to be measurable with respect to the spherical measure. Our main result shows that measurable divisibility is impossible for a generic (in various meanings) $r$-tuple of rotations. This is in stark contrast to the recent result of Conley, Marks and Unger which implies that, for every generic $r$-tuple, divisibility is possible with parts that have the property of Baire.
159 - Gert Almkvist 2008
An asymptotic formula for the number of partitions into p-cores is derived. As a byproduct some integer valued trigonometric sums are found
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا