English
Related papers

Related papers: Achievable Sets in Z^n

200 papers

An accessing set in a graph is a subset B of vertices such that there exists D subset of B, such that each vertex of V\B has an even number of neighbors in D. In this paper, we introduce new bounds on the minimal size kappa'(G) of an…

Computational Complexity · Computer Science 2011-10-05 Sylvain Gravier , Jérôme Javelle , Mehdi Mhalla , Simon Perdrix

A group $G$ is integrable if it is isomorphic to the derived subgroup of a group $H$; that is, if $H'\simeq G$, and in this case $H$ is an integral of $G$. If $G$ is a subgroup of $U$, we say that $G$ is integrable within $U$ if $G=H'$ for…

Group Theory · Mathematics 2022-07-08 Russell Blyth , Francesco Fumagalli , Francesco Matucci

The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…

Optimization and Control · Mathematics 2024-01-25 Daniel Dörfler , Andreas Löhne

Let ${\mathcal S}(\R)$ be an o-minimal structure over $\R$, $T \subset \R^{k_1+k_2+\ell}$ a closed definable set, and $$ \displaylines{\pi_1: \R^{k_1+k_2+\ell}\to \R^{k_1 + k_2}, \pi_2: \R^{k_1+k_2+\ell}\to \R^{\ell}, \ \pi_3: \R^{k_1 +…

Combinatorics · Mathematics 2011-02-21 Saugata Basu

A complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize completely…

Formal Languages and Automata Theory · Computer Science 2018-05-09 Eugenija Bondar , Mikhail Volkov

A $k$-uniform hypergraph $M$ is set-homogeneous if it is countable (possibly finite) and whenever two finite induced subhypergraphs $U,V$ are isomorphic there is $g\in Aut(M)$ with $U^g=V$; the hypergraph $M$ is said to be homogeneous if in…

Logic · Mathematics 2022-02-22 Amir Assari , Narges Hosseinzadeh , Dugald Macpherson

A saturated fusion system over a finite $p$-group $S$ is a category whose objects are the subgroups of $S$ and whose morphisms are injective homomorphisms between the subgroups satisfying certain axioms. A fusion system over $S$ is realized…

Group Theory · Mathematics 2023-07-13 Carles Broto , Jesper Møller , Bob Oliver , Albert Ruiz

A $k$-connected set in an infinite graph, where $k > 0$ is an integer, is a set of vertices such that any two of its subsets of the same size $\ell \leq k$ can be connected by $\ell$ disjoint paths in the whole graph. We characterise the…

Combinatorics · Mathematics 2020-09-21 J. Pascal Gollin , Karl Heuer

We consider infinite graphs and the associated energy forms. We show that a graph is canonically compactifiable (i.e. all functions of finite energy are bounded) if and only if the underlying set is totally bounded with respect to any…

Metric Geometry · Mathematics 2020-09-28 Simon Puchert

Let K be the kernel of an epimorphism G -> Z, where G is a finitely presented group. If K has infinitely many subgroups of index 2, 3, or 4, then it has uncountably many. Moreover, if K is the commutator subgroup of a classical knot group…

Geometric Topology · Mathematics 2007-05-23 Daniel S. Silver , Susan G. Williams

Let $G=(V(G),E(G))$ be a graph with set of vertices $V(G)$ and set of edges $E(G)$. A subset $S$ of $E(G)$ is called a $k$-nearly independent edge subsets if there are exactly $k$ pairs of elements of $S$ that share a common end. $Z_k(G)$…

Combinatorics · Mathematics 2024-05-28 Eric O. D. Andriantiana , Zekhaya B. Shozi

The paper studies the structure of restricted Leibniz algebras. More specifically speaking, we first give the equivalent definition of restricted Leibniz algebras, which is by far more tractable than that of a restricted Leibniz algebras in…

Rings and Algebras · Mathematics 2014-04-01 Baoling Guan , Liangyun Chen

It is shown that for a solvable subgroup $G$ of an almost simple group $S$ which socle is isomorphic to $A_n$ $ (n\ge5)$ there are $x,y,z,t \in S$ such that $G \cap G^x \cap G^y \cap G^z \cap G^t =1.$

Group Theory · Mathematics 2019-06-21 Anton Baykalov

Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…

Group Theory · Mathematics 2025-04-29 Lorenzo Bonazzi

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Joey Becker , F. Blanchet-Sadri , Laure Flapan , Stephen Watkins

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-03-29 Georgiana Fasolă , Marius Tărnăuceanu

Below, by space we mean a separable metrizable zero-dimensional space. It is studied when the space can be embedded in a Cantor set while maintaining the algebraic structure. Main results of the work: every space is an open retract of a…

General Topology · Mathematics 2023-06-13 Evgenii Reznichenko

If G is a locally essential subgroup of a compact abelian group K, then: (i) t(G)=w(G)=w(K), where t(G) is the tightness of G; (ii) if G is radial, then K must be metrizable; (iii) G contains a super-sequence S converging to 0 such that…

General Topology · Mathematics 2019-11-12 Dikran Dikranjan , Dmitri Shakhmatov

A set of geometric graphs is {\em geometric-packable} if it can be asymptotically packed into every sequence of drawings of the complete graph $K_n$. For example, the set of geometric triangles is geometric-packable due to the existence of…

Combinatorics · Mathematics 2022-12-06 Daniel W. Cranston , Jiaxi Nie , Jacques Verstraëte , Alexandra Wesolek

We give explicit, practical conditions that determine whether or not a closed, connected subgroup H of G = SU(2,n) has the property that there exists a compact subset C of G with CHC = G. To do this, we fix a Cartan decomposition G = K A K…

Representation Theory · Mathematics 2007-05-23 Alessandra Iozzi , Dave Witte