English
Related papers

Related papers: Achievable Sets in Z^n

200 papers

Let $P$ and $Q$ be finite point sets of the same cardinality in $\mathbb{R}^2$, each labelled from $1$ to $n$. Two noncrossing geometric graphs $G_P$ and $G_Q$ spanning $P$ and $Q$, respectively, are called compatible if for every face $f$…

We characterize conformally removable sets in the plane with the aid of the recent developments in the theory of metric surfaces. We prove that a compact set in the plane is $S$-removable if and only if there exists a quasiconformal map…

Complex Variables · Mathematics 2024-09-02 Dimitrios Ntalampekos

Let $T$ be a theory which is t-minimal, meaning that with respect to some definable topology, a unary definable set $D \subseteq M$ has non-empty interior iff it is infinite. If $K$ is a definable field in $T$, then $K$ is finite or "large"…

Logic · Mathematics 2026-05-11 Will Johnson

Given a construction $f$ on groups, we say that a group $G$ is \textit{$f$-realisable} if there is a group $H$ such that $G\cong f(H)$, and \textit{completely $f$-realisable} if there is a group $H$ such that $G\cong f(H)$ and every…

Group Theory · Mathematics 2023-10-20 Georgiana Fasolă , Marius Tărnăuceanu

We prove two characterisations of accessibility of locally finite quasi-transitive connected graphs. First, we prove that any such graph $G$ is accessible if and only if its set of separations of finite order is an ${\rm Aut}(G)$-finitely…

Combinatorics · Mathematics 2024-09-05 Matthias Hamann , Babak Miraftab

A set of vertices in a graph is agile if, however we partition the set into two parts, we can always find two vertex-disjoint connected subgraphs where one covers the first and the other the second part. We present a characterization for…

Combinatorics · Mathematics 2025-05-20 Christian Elbracht , Jay Lilian Kneip , Maximilian Teegen

The deck, $\mathcal{D}(X)$, of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}]\colon x \in X\}$, where $[Y]$ denotes the homeomorphism class of $Y$. A space $X$ is (topologically) reconstructible if whenever…

General Topology · Mathematics 2015-10-12 Paul Gartside , Max F. Pitz , Rolf Suabedissen

A topological group $G$ is called an $M_\omega$-group if it admits a countable cover $\K$ by closed metrizable subspaces of $G$ such that a subset $U$ of $G$ is open in $G$ if and only if $U\cap K$ is open in $K$ for every $K\in\K$. It is…

General Topology · Mathematics 2011-08-23 Taras Banakh

A complex manifold $X$ is called "LCK manifolds with potential" if it can be realized as a complex submanifold of a Hopf manifold. Let $Y$ its $\Z$-covering, considered as a complex submanifold in $C^n \backslash 0$. We prove that $Y$ is…

Algebraic Geometry · Mathematics 2024-05-24 Liviu Ornea , Misha Verbitsky

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

Group Theory · Mathematics 2024-02-12 David G. Costanzo , Mark L. Lewis , Stefano Schmidt , Eyob Tsegaye , Gabe Udell

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

We prove that for every compactum X and every integer $n \geq 2$ there are a compactum Z of $\dim \leq n$ and a surjective $UV^{n-1}$-map $r: Z \lo X$ having the property that: for every finitely generated abelian group G and every integer…

General Topology · Mathematics 2007-05-23 Michael Levin

We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…

Logic · Mathematics 2017-01-06 Hakim J. Walker

A given subset $A$ of natural numbers is said to be complete if every element of $\mathbb{N}$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete.…

Combinatorics · Mathematics 2023-04-05 Norbert Hegyvári

Given a finite group $G$, its prime graph $\Gamma(G)$ (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of $|G|$ and where edges $\{p, q\}$ exist whenever $G$ contains an element of order $pq$. We…

Group Theory · Mathematics 2025-11-21 Lucas Alland , Andrei Fridman , Thomas Michael Keller

This paper covers some recent progress in the study of sg-open sets, sg-compact spaces, N-scattered spaces and some related concepts. A subset $A$ of a topological space $(X,\tau)$ is called sg-closed if the semi-closure of $A$ is included…

General Topology · Mathematics 2007-05-23 Julian Dontchev

We make three observations regarding a question popularized by Katznelson: is every subset of $\mathbb Z$ which is a set of Bohr recurrence is also a set of topological recurrence? (i) If $G$ is a countable abelian group and $E\subset G$ is…

Dynamical Systems · Mathematics 2022-08-02 John T. Griesmer

Let $G$ be a $3$-connected graph. A set $W \subset V(G)$ is called contractible if $G(W)$ is a connected graph and $G - W$ is a $2$-connected graph. In 1994, McCuaig and Ota conjectured that for any $k \in \mathbb{N}$ there exists $n \in…

Combinatorics · Mathematics 2026-05-01 Nikolai Karol

A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. It was conjectured that in each completely…

Formal Languages and Automata Theory · Computer Science 2024-03-20 David Casas , Mikhail V. Volkov

Let K >= 1 be a parameter. A K-approximate group is a finite set A in a (local) group which contains the identity, is symmetric, and such that A^2 is covered by K left translates of A. The main result of this paper is a qualitative…

Group Theory · Mathematics 2011-10-26 Emmanuel Breuillard , Ben Green , Terence Tao
‹ Prev 1 3 4 5 6 7 10 Next ›