Related papers: Existence of Large Independent-Like Sets

Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…

Let $R$ be a commutative ring and $\Gamma$ be an infinite discrete group. The algebraic $K$-theory of the group ring $R[\Gamma]$ is an important object of computation in geometric topology and number theory. When the group ring is…

A collection $\mathcal S$ of equivalence classes of positive definite integral quadratic forms in $n$ variables is called an $n$-exceptional set if there exists a positive definite integral quadratic form which represents all equivalence…

A set A of positive integers is called a perfect difference set if every nonzero integer has an unique representation as the difference of two elements of A. We construct dense perfect difference sets from dense Sidon sets. As a consequence…

Let $G$ be a finite group. The group pseudo-algebra of $G$ is defined as the multi-set $C(G)=\{(d,m_G(d))\mid d\in{\rm Cod}(G)\},$ where $m_G(d)$ is the number of irreducible characters of with codegree $d\in {\rm Cod}(G)$. We show that…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size. Two graphs are said to be \textit{independence equivalent} if they have equivalent independence polynomials. We extend…

Let $G$ be a simple, connected and finite graph with order $n$. Denote the independence number, edge independence number and total independence number by $\alpha(G), \alpha'(G)$ and $\alpha"(G)$ respectively. This paper establishes a…

In this paper, we study nilpotent $\mathbb{Q}$$[x]$-powered groups that satisfy the following property: For some set of primes $\omega$ in $\mathbb{Q}$$[x]$, every $\omega '$-isolated $\mathbb{Q}$$[x]$-subgroup in some family of its…

We revisit the classical kernel method of approximation/interpolation theory in a very specific context motivated by the desire to obtain a robust procedure to approximate discrete data sets by (super)level sets of functions that are merely…

Given a finite group $G$ and a generating set $S \subseteq G$, the diameter $diam(G,S)$ is the least integer $n$ such that every element of $G$ is the product of at most $n$ elements of $S$. In this paper, for bounded $|S|$, we characterize…

In the classic "Concrete Math", by Graham, Patashnik and Knuth, it is stated that "The numbers in Pascal's triangle satisfy, practically speaking, infinitely many identities, so it is not too surprising that we can find some surprising…

By an independent set in a simple graph $G$, we mean a set of pairwise non-adjacent vertices in $G$. The independence polynomial of $G$ is defined as $I_G(z)=a_0 + a_1 z + a_2 z^2+\cdots+a_\alpha z^{\alpha}$, where $a_i$ is the number of…

Consider any sequence of finite groups $A^t$, where $t$ takes values in an integer index set $\mathbf{Z}$. A group system $A$ is a set of sequences with components in $A^t$ that forms a group under componentwise addition in $A^t$, for each…

We consider the problem of explicitly computing dimensions of spaces of automorphic or modular forms in level one, for a split classical group $\mathbf{G}$ over $\mathbb{Q}$ such that $\mathbf{G}(\R)$ has discrete series. Our main…

A vertex subset $W\subseteq V$ of the graph $G=(V,E)$ is an independent dominating set if every vertex in $V\backslash W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. The independent…

Sparse-dense partitions was introduced by Feder, Hell, Klein, and Motwani [STOC 1999, SIDMA 2003] as a tool to solve partitioning problems. In this paper, the following result concerning independent sets in graphs having sparse-dense…

Let $G$ be a group. An automorphism of $G$ is called intense if it sends each subgroup of $G$ to a conjugate; the collection of such automorphisms is denoted by $\mathrm{Int}(G)$. In the special case in which $p$ is a prime number and $G$…

In this note, we investigate how different fundamental groups of presentations of a fixed algebra $A$ can be. For finitely many finitely presented groups $G_i$, we construct an algebra $A$ such that all $G_i$ appear as fundamental groups of…

In this paper we study conjugacy and subgroup separability properties in the class of nilpotent $\mathbb{Q}[x]$-powered groups. Many of the techniques used to study these properties in the context of ordinary nilpotent groups carry over…

In his seminal work on Sidon sets, Pisier found an important characterization of Sidonicity: A set is Sidon if and only if it is proportionally quasi-independent. Later, it was shown that Sidon sets were proportionally `special' Sidon in…