English
Related papers

Related papers: Self-affinity of discs under glass-cut dissections

200 papers

In this note we prove that any monohedral tiling of the closed circular unit disc with $k \leq 3$ topological discs as tiles has a $k$-fold rotational symmetry. This result yields the first nontrivial estimate about the minimum number of…

Geometric Topology · Mathematics 2019-10-10 Árpád Kurusa , Zsolt Lángi , Viktor Vígh

The self intersection of an immersion i : S^2 \to R^3 dissects S^2 into pieces which are planar surfaces (unless i is an embedding). In this work we determine what collections of planar surfaces may be obtained in this way. In particular,…

Geometric Topology · Mathematics 2007-05-23 Tahl Nowik

Thin astrophysical discs are very often modelled using the equations of two-dimensional hydrodynamics. We derive an extension of this model that describes more accurately the behaviour of a thin disc in the absence of self-gravity, magnetic…

Solar and Stellar Astrophysics · Physics 2018-03-21 Gordon I. Ogilvie

A set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in $S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number…

Discrete Mathematics · Computer Science 2020-01-10 A. Akbari , S. Akbari , A. Doosthosseini , Z. Hadizadeh , Michael A. Henning , A. Naraghi

We characterize embedded $\C^1$ hypersurfaces of $\R^n$ as the only locally closed sets with continuously varying flat tangent cones whose measure-theoretic-multiplicity is at most $m<3/2$. It follows then that any (topological)…

Algebraic Geometry · Mathematics 2013-09-17 Mohammad Ghomi , Ralph Howard

A convex cone is said to be projectionally exposed (p-exposed) if every face arises as a projection of the original cone. It is known that, in dimension at most four, the intersection of two p-exposed cones is again p-exposed. In this paper…

Optimization and Control · Mathematics 2025-01-23 Bruno F. Lourenço , Vera Roshchina , James Saunderson

Let Y be a smooth del Pezzo surface of degree 3 polarized by a very ample divisor that is not proportional to the anticanonical one. Then the affine cone over Y is flexible in codimension one. Equivalently, such a cone has an open subset…

Algebraic Geometry · Mathematics 2024-04-18 Alexander Perepechko

It is classically known that complete flat surfaces in Euclidean 3-space are cylinders over space curves. This implies that the study of global behaviour of flat surfaces requires the study of singular points as well. If a flat surface $f$…

Differential Geometry · Mathematics 2008-12-25 Satoko Murata , Masaaki Umehara

An affine surface is said to be an affine Zoll surface if all affine geodesics close smoothly. It is said to be an affine almost Zoll surface if thru any point, every affine geodesic but one closes smoothly (the exceptional geodesic is said…

Differential Geometry · Mathematics 2020-06-18 Peter B Gilkey

A graph is $n$-e.c. ($n$-existentially closed) if for every pair of subsets $A, B$ of vertex set $V$ of the graph such that $A \cap B = \emptyset$ and $|A| + |B| = n$, there is a vertex $z$ not in $A \cup B$ joined to each vertex of $A$ and…

Combinatorics · Mathematics 2009-03-17 Le Anh Vinh

A $k$-regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have exactly $\lambda_1$ common neighbors, and two…

Combinatorics · Mathematics 2022-04-18 Dmitry Panasenko , Leonid Shalaginov

We prove that any compact surface with constant positive curvature and conical singularities can be decomposed into irreducible components of standard shape, glued along geodesic arcs connecting conical singularities. This is a spherical…

Geometric Topology · Mathematics 2022-01-05 Guillaume Tahar

A convex geometric graph is a graph whose vertices are the corners of a convex polygon P in the plane and whose edges are boundary edges and diagonals of the polygon. It is called triangulation-free if its non-boundary edges do not contain…

Combinatorics · Mathematics 2025-08-19 David Garber , Chaya Keller , Olga Nissenbaum , Shimon Aviram

The evolution and spatial structure of displacement fronts in fractures with self-affine rough walls are studied by numerical simulations. The fractures are open and the two faces are identical but shifted along their mean plane, either…

Statistical Mechanics · Physics 2016-05-02 G. Drazer , H. Auradou , J. Koplik , J. P. Hulin

A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…

Combinatorics · Mathematics 2019-08-06 Yu Qing Chen , Teng Fang , Sanming Zhou

We prove that entire conformal curves $\mathbb{R}^n \rightarrow \mathbb{R}^m$ fall into two classes: either the curve is affine or the average energy in a ball is strictly increasing for large radii and diverges to infinity. This rigidity…

Differential Geometry · Mathematics 2025-09-05 Toni Ikonen

Angle-resolved photoemission and X-ray diffraction experiments show that multilayer epitaxial graphene grown on the SiC(000-1) surface is a new form of carbon that is composed of effectively isolated graphene sheets. The unique rotational…

Let $G$ be a graph. A good function is a function $f:V(G)\rightarrow \{-1,1\}$, satisfying $f(N(v))\geq 1$, for each $v\in V(G)$, where $ N(v)=\{u\in V(G)\, |\, uv\in E(G) \} $ and $f(S) = \sum_{u\in S} f(u)$ for every $S \subseteq V(G) $.…

Discrete Mathematics · Computer Science 2014-06-12 S. Akbari , M. Dalirrooyfard , S. Davodpoor , K. Ehsani , R. Sherkati

For any finite group $G$, and any positive integer $n$, we construct an association scheme which admits the diagonal group $D_n(G)$ as a group of automorphisms. The rank of the association scheme is the number of partitions of $n$ into at…

Group Theory · Mathematics 2020-09-25 Peter J. Cameron , Sean Eberhard

In fair division of a connected graph $G = (V, E)$, each of $n$ agents receives a share of $G$'s vertex set $V$. These shares partition $V$, with each share required to induce a connected subgraph. Agents use their own valuation functions…

Computer Science and Game Theory · Computer Science 2024-02-09 Jiehua Chen , William S. Zwicker