English
Related papers

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

200 papers

Let $S$ be a generic submanifold of $C^N$ of real codimension m. In this work we continue the study, carried over by various authors, of the set of analytic discs attached to S. Let $M$ be the set of analytic discs attached to $S.$ Given $q…

Complex Variables · Mathematics 2008-02-03 Stefano Trapani

A subset $X$ of an Abelian group $G$ is called $semiaf\!fine$ if for every $x,y,z\in X$ the set $\{x+y-z,x-y+z\}$ intersects $X$. We prove that a subset $X$ of an Abelian group $G$ is semiaffine if and only if one of the following…

Group Theory · Mathematics 2023-05-16 Iryna Banakh , Taras Banakh , Maria Kolinko , Alex Ravsky

A map $f: \ff^n \to \ff^n$ over a field $\ff$ is called affine if it is of the form $f(x)=Ax+b$, where the matrix $A \in \ff^{n\times n}$ is called the linear part of affine map and $b \in \ff^n$. The affine maps over $\ff=\rr$ or $\cc$ are…

K-Theory and Homology · Mathematics 2009-02-11 Budnytska Tetiana

It is shown that a canonical geometric setting of the integrable TED equation is a Kahlerian tangent bundle of an affine manifold. The remarkable multi-dimensional consistency of this 4+4-dimensional dispersionless partial differential…

Exactly Solvable and Integrable Systems · Physics 2024-02-20 W. K. Schief , U. Hertrich-Jeromin , B. G. Konopelchenko

The dimension of the visible part of self-affine sets, that satisfy domination and a projection condition, is being studied. The main result is that the assouad dimension of the visible part equals to 1 for all directions outside the set of…

Classical Analysis and ODEs · Mathematics 2021-04-22 Eino Rossi

A digraph is called an $n$-Cayley digraph if its automorphism group has an $n$-orbit semiregular subgroup. We determine the splitting fields of $n$-Cayley digraphs over abelian groups and compute a bound on their algebraic degrees, before…

Combinatorics · Mathematics 2024-01-17 Hao Li , Xiaogang Liu

Let $G$ be a nonabelian group and $n$ a natural number. We say that $G$ has a strict $n$-split decomposition if it can be partitioned as the disjoint union of an abelian subgroup $A$ and $n$ nonempty subsets $B_1, B_2, \ldots, B_n$, such…

Group Theory · Mathematics 2018-06-07 M. L. Lewis , D. V. Lytkina , V. D. Mazurov , A. R. Moghaddamfar

An unfriendly partition of a graph $G = (V,E)$ is a function $c: V \to 2$ such that $|\{x\in N(v): c(x)\neq c(v)\}|\geq |\{x\in N(v): c(x)=c(v)\}|$ for every vertex $v\in V$, where $N(v)$ denotes its neighborhood. It was conjectured by…

Combinatorics · Mathematics 2023-04-06 Leandro Fiorini Aurichi , Lucas Real

A cube is used as a fair die of 6 faces. However, there are many dice of different shapes on the market. To make them fair, most of them usually have some symmetric shapes. We here classify these variants of dice on the market into two…

History and Overview · Mathematics 2018-10-30 Tomoko Taniguchi , Ryuhei Uehara

A simple $n$-gon is a polygon with $n$ edges with each vertex belonging to exactly two edges and every other point belonging to at most one edge. Brass asked the following question: For $n \geq 5$ odd, what is the maximum perimeter of a…

Metric Geometry · Mathematics 2010-04-01 Zsolt Langi

Every simple quadrangulation of the sphere is generated by a graph called a pseudo-double wheel with two local expansions (Brinkmann et al. "Generation of simple quadrangulations of the sphere." Discrete Math., Vol. 305, No. 1-3, pp. 33-54,…

Metric Geometry · Mathematics 2012-10-08 Yohji Akama

We define a cap in the affine geometry AG(n,2) to be a subset in which every collection of four points is in general position. In this paper, we classify, up to affine equivalence, all caps in AG(7,2) of size k greater than or equal to 10.…

Combinatorics · Mathematics 2025-01-22 Karianne Calta , Timothy E. Goldberg , Lauren L. Rose

We study two-digit attractors (2-attractors) in $\mathbb{R}^d$ which are self-affine compact sets defined by two contraction affine mappings with the same linear part. They are widely studied in the literature under various names:…

Functional Analysis · Mathematics 2020-07-23 Vladimir Yu. Protasov , Tatyana Zaitseva

An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…

Optimization and Control · Mathematics 2009-12-10 William Hager , Dzung Phan , Hongchao Zhang

We study self-similar attractors in the space $\mathbb{R}^d$, i.e., self-similar compact sets defined by several affine operators with the same linear part. The special case of attractors when the matrix $M$ of the linear part of affine…

Metric Geometry · Mathematics 2021-02-03 Tatyana Zaitseva

A uniform space $X$ is said to be proximally fine if every proximally continuous map on $X$ into a uniform is uniformly continuous. We supply a proof that every topological group which is functionnaly generated by its precompact subsets is…

General Topology · Mathematics 2019-04-30 Ahmed Bouziad

An iterated function system $\Phi$ consisting of contractive similarity mappings has a unique attractor $F \subseteq \mathbb{R}^d$ which is invariant under the action of the system, as was shown by Hutchinson [Hut]. This paper shows how the…

Metric Geometry · Mathematics 2010-07-30 Erin P. J. Pearse

In this paper, we study strictly convex affine hypersurfaces centroaffinely congruent to their centre map, in the case when the shape operator has two distinct eigenvalues: one of multiplicity 1, and one nonzero of multiplicity n-1. We show…

Differential Geometry · Mathematics 2012-06-04 A. J. Vanderwinden

We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this…

Computational Geometry · Computer Science 2007-05-23 Jeff Erickson , Sariel Har-Peled

Motivated by a result of [1] which states that if F is a subgraph of a convex complete graph K_n and F contains no boundary edge of K_n and |E(F)| \leq n-3, then K_n - F admits a triangulation, we determine necessary and sufficient…

Combinatorics · Mathematics 2016-11-29 Niran Abbas Ali , Gek L. Chia , Hazim Michman Trao , Adem Kilicman