English
Related papers

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

200 papers

We provide a partial answer to Burns' 1982 conjecture on the affineness of entire Grauert tubes: the complement of a codimension-one subset of an entire Grauert tube is affine. This result is obtained by establishing a generalized version…

Complex Variables · Mathematics 2026-05-08 Kyobeom Song

A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the…

Combinatorics · Mathematics 2015-07-22 François Dross

We study tangent sets of strictly self-affine sets in the plane. If a set in this class satisfies the strong separation condition and projects to a line segment for sufficiently many directions, then for each generic point there exists a…

Classical Analysis and ODEs · Mathematics 2017-08-22 Antti Kaenmaki , Henna Koivusalo , Eino Rossi

We develop several aspects of the theory of gaseous astrophysical discs in which the gravity of the disc makes a significant contribution to its structure and dynamics. We show how the internal gravitational potential can be expanded in…

Solar and Stellar Astrophysics · Physics 2025-03-18 Gordon I. Ogilvie

A polycrystalline graphene consists of perfect domains tilted at angle {\alpha} to each other and separated by the grain boundaries (GB). These nearly one-dimensional regions consist in turn of elementary topological defects, 5-pentagons…

Materials Science · Physics 2010-09-16 Yuanyue Liu , Boris I. Yakobson

We show that for $n \geq 3, n\ne 5$, in any partition of $\mathcal{P}(n)$, the set of all subsets of $[n]=\{1,2,\dots,n\}$, into $2^{n-2}-1$ parts, some part must contain a triangle --- three different subsets $A,B,C\subseteq [n]$ such that…

Combinatorics · Mathematics 2018-12-18 Eben Blaisdell , András Gyárfás , Robert A. Krueger , Ronen Wdowinski

A graph is reducible if it is the lexicographic product of two smaller non-trivial graphs. It is well-known a 1-planar graph with $n ~(\ge3)$ vertices has at most $4n-8$ edges, and a graph $G$ with $n$ vertices is optimal if $G$ has exactly…

Combinatorics · Mathematics 2024-12-20 Licheng Zhang , Yuanqiu Huang

We study the problem of arranging a set of $n$ disks with prescribed radii on $n$ rays emanating from the origin such that two neighboring rays are separated by an angle of $2\pi/n$. The center of the disks have to lie on the rays, and no…

Computational Geometry · Computer Science 2011-09-09 Immanuel Halupczok , Andre Schulz

We consider digit systems $(A,\mathcal{D})$, where $ A \in \mathbb{Q}^{n\times n}$ is an expanding matrix and the digit set $\mathcal{D}$ is a suitable subset of $\mathbb{Q}^n$. To such a system, we associate a self-affine set $\mathcal{F}…

Number Theory · Mathematics 2024-07-09 Lucía Rossi , Wolfgang Steiner , Jörg M. Thuswaldner

I extend the framework of rigid analytic geometry to the setting of algebraic geometry relative to monoids, and study the associated notions of separated, proper, and overconvergent morphisms. The category of affine manifolds embeds as a…

Algebraic Geometry · Mathematics 2015-05-29 Andrew W. Macpherson

A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…

Combinatorics · Mathematics 2022-08-31 Nikita Chernega , Alexandr Polyanskii , Rinat Sadykov

An almost self-centered graph is a connected graph of order $n$ with exactly $n-2$ central vertices, and an almost peripheral graph is a connected graph of order $n$ with exactly $n-1$ peripheral vertices. We determine (1) the maximum girth…

Combinatorics · Mathematics 2021-06-24 Yanan Hu , Xingzhi Zhan

We study the decidability of the topological properties of some objects coming from fractal geometry. We prove that having empty interior is undecidable for the sets defined by two-dimensional graph-directed iterated function systems. These…

Formal Languages and Automata Theory · Computer Science 2014-09-26 Timo Jolivet , Jarkko Kari

An affine spread is a set of subspaces of $\mathrm{AG}(n, q)$ of the same dimension that partitions the points of $\mathrm{AG}(n, q)$. Equivalently, an {\em affine spread} is a set of projective subspaces of $\mathrm{PG}(n, q)$ of the same…

Combinatorics · Mathematics 2024-02-13 Somi Gupta , Francesco Pavese

A group G is a cn-group if for each subgroup H of G there exists a normal subgroup N of G such that the index of both H and N in HN is finite. The class of cn-groups contains properly the classes of core- finite groups and that of groups in…

Group Theory · Mathematics 2017-05-09 Carlo Casolo , Ulderico Dardano , Silvana Rinauro

The Gruenberg-Kegel graph of a group is the undirected graph whose vertices are those primes which occur as the order of an element of the group, and distinct vertices $p$, $q$ are joined by an edge whenever the group has an element of…

Group Theory · Mathematics 2026-04-07 Andreas Bächle , Ann Kiefer , Sugandha Maheshwary , Ángel del Río

Although the concept of defect of an analytic disc attached to a generic manifold of $\C^{n}$ seems to play a merely technical role, it turns out to be a rather deep and fruitful notion for the extendability of CR functions defined on the…

Complex Variables · Mathematics 2016-09-06 Patrizia Rossi

An affine manifold is a manifold with torsion-free flat affine connection. A geometric topologist's definition of an affine manifold is a manifold with an atlas of charts to the affine space with affine transition functions; a radiant…

dg-ga · Mathematics 2016-01-28 Suhyoung Choi

We give a computer-based proof of the following fact: If a square is divided into seven or nine convex polygons, congruent among themselves, then the tiles are rectangles.

Computational Geometry · Computer Science 2021-11-24 Gerardo L. Maldonado , Edgardo Roldán-Pensado

Self-concordance is the most important property required for barriers in convex programming. It is intrinsically linked to the affine structure of the underlying space. Here we introduce an alternative notion of self-concordance which is…

Optimization and Control · Mathematics 2021-03-16 Roland Hildebrand