Related papers: Veroneseans, power subspaces and independence

We show that the number of independent sets in an N-vertex, d-regular graph is at most (2^{d+1} - 1)^{N/2d}, where the bound is sharp for a disjoint union of complete d-regular bipartite graphs. This settles a conjecture of Alon in 1991 and…

We prove several reflection theorems on $D$-spaces, which are Hausdorff topological spaces $X$ in which for every open neighbourhood assignment $U$ there is a closed discrete subspace $D$ such that \[ \bigcup\{U(x): x\in D\}=X. \] The…

We prove several reflection theorems on $D$-spaces, which are Hausdorff topological spaces $X$ in which for every open neighbourhood assignment $U$ there is a closed discrete subspace $D$ such that \[ \bigcup\{U(x): x\in D\}=X. \] The…

We give an efficient algorithm that, given a graph $G$ and a partition $V_1,\ldots,V_m$ of its vertex set, finds either an independent transversal (an independent set $\{v_1,\ldots,v_m\}$ in $G$ such that $v_i\in V_i$ for each $i$), or a…

We study topological versions of an independent set in an abelian group and a linearly independent set in a vector space, a {\em topologically independent set} in a topological group and a {\em topologically linearly independent set} in a…

We say that a linear space is harmonious if it is resolvable and admits an automorphism group acting sharply transitively on the points and transitively on the parallel classes. Generalizing old results by the first author et al. we present…

Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…

The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n/2$. Levit and Mandrescu…

We establish the independence of multipliers for polynomial endomorphisms of $\mathbb C^n$ and endomorphisms of $\mathbb P^n.$ This allows us to extend results about the bifurcation measure and the critical height obtained in…

In this paper we provide an asymptotic expansion for the number of independent sets in a general class of regular, bipartite graphs satisfying some vertex-expansion properties, extending results of Jenssen and Perkins on the hypercube and…

We define the $m$th Veronese power of a weight graded operad $\mathcal{P}$ to be its suboperad $\mathcal{P}^{[m]}$ generated by operations of weight $m$. It turns out that, unlike Veronese powers of associative algebras, homological…

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…

Let $\PP^d$ be the $d$-fold direct product of the set of primes. We prove that if $A$ is a subset of $\PP^d$ of positive relative upper density then $A$ contains infinitely many "corners", that is sets of the form $\{x,x+te_1,...,x+te_d\}$…

Chebyshev polynomials and their modifications are attributes of various fields of mathematics. In particular, they are generating functions of the rows elements of certain Riordan matrices. In paper, we give a selection of some…

Polynomial-in-time dependent symmetries are analysed for polynomial-in-time dependent evolution equations. Graded Lie algebras, especially Virasoro algebras, are used to construct nonlinear variable-coefficient evolution equations, both in…

We show that monomial Cremona maps of degree d on P^n can have inverses whose degree d' is quite large (for d > 2, d' = ((d-1)^n - 1)/(d-2) occurs), and that the full list of degrees d' does not always form an interval. An easy method for…

We consider a generic family of polynomial maps $f:=(f_1,f_2):\mathbb{C}^2\rightarrow\mathbb{C}^2$ with given supports of polynomials, and degree $ d(f):=\max (deg f_1, deg f_2)$. We show that the (non-) properness of maps $f$ in this…

We study the algorithmic task of finding large independent sets in Erdos-Renyi $r$-uniform hypergraphs on $n$ vertices having average degree $d$. Krivelevich and Sudakov showed that the maximum independent set has density $\left(\frac{r\log…

For a nonempty compact set D of R we determine the maximal possible dimension of a subspace X of polynomial functions of degree at most m which possesses a positive bases (where positivity is understood on D). The exact value of this…