Related papers: Achievable Sets in Z^n

A given subset $A$ of natural numbers is said to be complete if every element of $\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. The main goal of…

A topological space is reversible if each continuous bijection of it onto itself is open. We introduce an analogue of this notion in the category of topological groups: A topological group G is g-reversible if every continuous automorphism…

We call a subalgebra $U$ of a Lie algebra $L$ a $CAP$-subalgebra of $L$ if for any chief factor $H/K$ of $L$, we have $H \cap U = K \cap U$ or $H+U = K+U$. In this paper we investigate some properties of such subalgebras and obtain some…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

For every $n \geq 1$, let $(\mathrm{FW}_n)$ denote the fixed-point property for median graphs of cubical dimension $n$ (or equivalently, for CAT(0) cube complexes of dimension $n$). In this article, we construct explicit examples of groups…

We prove that every countable subgroup of a compact metrizable abelian group has a characterizing set. As an application, we answer several questions on maximally almost periodic (MAP) groups and give a characterization of the class of…

A theorem of A. Weil asserts that a topological group embeds as a (dense) subgroup of a locally compact group if and only if it contains a non-empty precompact open set; such groups are called locally precompact. Within the class of locally…

We prove that a large class of metrizable group topologies for subgroups of $\mathbb{R}^n$ and the completions of the subgroups are locally isometric to, respectively, metrizable group topologies for $\mathbb{Z}$ and their completions,…

Let $A$ be a finite-dimensional commutative associative algebra with unity over an algebraically closed field $\mathbb{K}$. The purpose of the paper is to study the solvability of $G_A$, where $G_A$ is the identity component of…

A topological group G is h-complete if every continuous homomorphic image of G is (Raikov-)complete; we say that G is hereditarily h-complete if every closed subgroup of G is h-complete. In this paper, we establish open-map properties of…

In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$…

We consider the problem of determining, given x, y in Z^k and a finite set F of affine functions on Z^k, whether y is reachable from x by applying the functions F. We also consider the analogous problem over N^k. These problems are known to…

For two not necessarily commutative topological groups G and T, let H(G,T) denote the space of all continuous homomorphisms from G to T with the compact-open topology. We prove that if G is metrizable and T is compact then H(G,T) is a…

A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…

Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…

A stable smooth map $f:N\to M$ is called "$k$-realizable" if its composition with the inclusion $M\subset M\times\Bbb R^k$ is $C^0$-approximable by smooth embeddings; and a "$k$-prem" if the same composition is $C^\infty$-approximable by…

Given an undirected graph G and a set A \subseteq V(G), an A-path is a path in G that starts and ends at two distinct vertices of A with intermediate vertices in V(G) \setminus A. An A-path is called an (A,\ell)-path if the length of the…

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

In the paper, we study special configurations of lines and points in the complex projective plane, so called k-nets. We describe the role of these configurations in studies of cohomology on arrangement complements. Our most general result…

Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite…