Cosmopolitan 发表于 2025-3-26 22:30:45
http://reply.papertrans.cn/67/6660/665967/665967_31.png偏见 发表于 2025-3-27 04:59:42
http://reply.papertrans.cn/67/6660/665967/665967_32.png粘土 发表于 2025-3-27 08:02:24
The Topological Transversal Tverberg Theorem Plus Constraints, lemma to show how one can obtain many new topological transversal theorems of Tverberg type. In particular, we derive a topological generalized transversal Van Kampen–Flores theorem and a topological transversal weak colored Tverberg theorem.高原 发表于 2025-3-27 10:41:11
,On the Volume of Boolean Expressions of Balls – A Review of the Kneser–Poulsen Conjecture,t the distances between the centers of the balls do not increase, then the volume of the union of the balls does not increase as well. Our goal is to give a survey of attempts to prove this conjecture, to discuss possible generalizations, and to collect some relevant open questions.路标 发表于 2025-3-27 14:57:33
,A Survey of Elekes-Rónyai-Type Problems,rge image on a Cartesian product ., unless . has a group-related special form. We discuss this problem and a number of variants and generalizations. This includes the Elekes-Szabó problem, which generalizes the Elekes-Rónyai problem to a question about an upper bound on the intersection of an algebrMadrigal 发表于 2025-3-27 21:12:46
The Geometry of Abrasion,rical theory for the abrasion of a single particle under collisions and extend it to include mutual abrasion of two particles and also frictional abrasion. Next we review the heuristically simplified box model [.], operating with ordinary differential equations, which also describes mutual abrasionthalamus 发表于 2025-3-28 01:22:52
Computing Upper Bounds for the Packing Density of Congruent Copies of a Convex Body,m is a generalization of the linear programming bound for sphere packings. We illustrate its use by computing an upper bound for the maximum density of packings of regular pentagons in the plane. Our computational approach is numerical and uses a combination of semidefinite programming, sums of squaIrrigate 发表于 2025-3-28 05:13:17
Two Geometrical Applications of the Semi-random Method,endent set in hypergraphs with certain uncrowdedness properties. The first geometrical application was a major achievement in the history of Heilbronn’s triangle problem. It proved that the original conjecture of Heilbronn was false. The semi-random method was extended and applied to other problems.侵略 发表于 2025-3-28 06:42:45
,Erdős–Szekeres Theorems for Families of Convex Sets,e subset in convex position. This classical result has been generalized in several directions. In this article we review recent progress related to one such direction, initiated by Bisztriczky and Fejes Tóth, in which the points are replaced by convex sets.外星人 发表于 2025-3-28 12:16:36
http://reply.papertrans.cn/67/6660/665967/665967_40.png