English
Related papers

Related papers: Achievable Sets in Z^n

200 papers

Considering the sets of subsums of series (or achievement sets) we show that for conditionally convergent series the multidimensional case is much more complicated than that of the real line. Although we are far from the full topological…

Functional Analysis · Mathematics 2016-04-27 Artur Bartoszewicz , Szymon Głab , Jacek Marchwicki

In the paper we consider the following conjecture: if a finite group $G$ possesses a solvable $\pi$-Hall subgroup $H$, then there exist elements $x,y,z,t\in G$ such that the identity $H\cap H^x\cap H^y\cap H^z\cap H^t=O_\pi(G)$ holds. The…

Group Theory · Mathematics 2010-08-17 E. P. Vdovin , V. I. Zenkov

A set $A$ is dually Dedekind finite if every surjection from $A$ onto $A$ is injective; otherwise, $A$ is dually Dedekind infinite. An amorphous set is an infinite set that cannot be partitioned into two infinite subsets. A strictly…

Logic · Mathematics 2025-10-16 Yifan Hu , Ruihuan Mao , Guozhen Shen

The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[m]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [m]$ of $[m]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…

Algebraic Topology · Mathematics 2018-09-18 Duško Jojić , Wacław Marzantowicz , Siniša T. Vrećica , Rade T. Živaljević

An abstract system of congruences describes a way of partitioning a space into finitely many pieces satisfying certain congruence relations. Examples of abstract systems of congruences include paradoxical decompositions and $n$-divisibility…

Logic · Mathematics 2020-02-26 Clinton T. Conley , Andrew S. Marks , Spencer T. Unger

A space $X$ is called {\it selectively pseudocompact} if for each sequence $(U_{n})_{n\in \mathbb{N}}$ of pairwise disjoint nonempty open subsets of $X$ there is a sequence $(x_{n})_{n\in \mathbb{N}}$ of points in $X$ such that $cl_X(\{x_n…

General Topology · Mathematics 2017-06-16 S. Garcia-Ferreira , A. H. Tomita

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Combinatorics · Mathematics 2010-11-30 Robert Gray , Rognvaldur G. Moller

This note is devoted to proving the following result: given a compact metrizable group G, there is a compact metric space K such that G is isomorphic (as a topological group) to the isometry group of K.

Group Theory · Mathematics 2007-05-23 Julien Melleray

Through careful analysis of types inspired by [AGTW21] we characterize a notion of definable compactness for definable topologies in general o-minimal structures, generalizing results from [PP07] about closed and bounded definable sets in…

Logic · Mathematics 2021-11-09 Pablo Andújar Guerrero

Let $M$ be a compact hyperkaehler manifold. The hyperkaehler structure equips $M$ with a set $R$ of complex structures parametrized by $CP^1$, called "the set of induced complex structures". It was known previously that induced complex…

alg-geom · Mathematics 2008-02-03 Misha Verbitsky

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. We characterize such automata in terms of graphs…

Formal Languages and Automata Theory · Computer Science 2022-01-14 Evgeniya A. Bondar , David Casas , Mikhail V. Volkov

We study the problem of accessibility in a set of classical and quantum channels admitting a group structure. Group properties of the set of channels, and the structure of the closure of the analyzed group $G$ plays a pivotal role in this…

Quantum Physics · Physics 2022-09-14 Koorosh Sadri , Fereshte Shahbeigi , Zbigniew Puchała , Karol Życzkowski

A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…

Combinatorics · Mathematics 2025-06-16 Rupert H. Levene , Polona Oblak , Helena Šmigoc

In this paper we give a realization of some symmetric space G/K as a closed submanifold P of G. We also give several equivalent representations of the submanifold P. Some properties of the set gK\cap P are also discussed, where gK is a…

Geometric Topology · Mathematics 2007-05-23 Jinpeng An , Zhengdong Wang

A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are…

Computational Geometry · Computer Science 2008-11-04 Muhammad Abdullah Adnan , Masud Hasan

An unsatisfiable formula is called minimal if it becomes satisfiable whenever any of its clauses are removed. We construct minimal unsatisfiable $k$-SAT formulas with $\Omega(n^k)$ clauses for $k \geq 3$, thereby negatively answering a…

Combinatorics · Mathematics 2008-11-05 Choongbum Lee

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

Group Theory · Mathematics 2021-09-14 Grechkoseeva Mariya

We prove that if $K$ is a compact subset of an affine variety O = P^n - D (where D is a projective hypersuface), and if K is a compact subset of a closed analytic subvariety V \subset O, then the projective hull K^ of K has the property…

Complex Variables · Mathematics 2007-05-23 Blaine Lawson , John Wermer

Let $K=Z/pZ$ and let $A$ be a subset of $\GL_r(K)$ such that $<A>$ is solvable. We reduce the study of the growth of $A$ under the group operation to the nilpotent setting. Specifically we prove that either $A$ grows rapidly (meaning…

Group Theory · Mathematics 2013-09-11 Nick Gill , Harald Andres Helfgott

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For…

Discrete Mathematics · Computer Science 2016-11-22 Vadim E. Levit , David Tankus