相关论文: Veroneseans, power subspaces and independence

The Veronese subalgebra $A_0$ of degree $d\geq 2$ of the polynomial algebra $A=K[x_1,x_2,\ldots,x_n]$ over a field $K$ in the variables $x_1,x_2,\ldots,x_n$ is the subalgebra of $A$ generated by all monomials of degree $d$ and the Veronese…

We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when the number $n$ of vertices is large. In particular we investigate which of these graphs yield the maximum numbers of independent sets of…

The program of understanding Shape Theory layer by layer topologically and geometrically -- proposed in Part I -- is now addressed for 4 points in 1-$d$. Topological shape space graphs are far more complex here, whereas metric shape spaces…

Let $\mathbb{K}$ be the Galois field $\mathbb{F}_{q^t}$ of order $q^t, q=p^e, p$ a prime, $A=\mathrm{Aut}(\mathbb{K})$ be the automorphism group of $\mathbb{K}$ and $\boldsymbol{\sigma}=(\sigma_0,\ldots, \sigma_{d-1}) \in A^d$, $d \geq 1$.…

We consider a space of complex polynomials of degree $n\ge 3$ with $n-1$ distinguished periodic orbits. We prove that the multipliers of these periodic orbits considered as algebraic functions on that space, are algebraically independent…

We consider the number of independent sets in hypergraphs, which allows us to define the independence density of countable hypergraphs. Hypergraph independence densities include a broad family of densities over graphs and relational…

$\newcommand{\eps}{\varepsilon}$ We observe that a $(1-\eps)$-approximation algorithm to Independent Set, that works for any induced subgraph of the input graph, can be used, via a polynomial time reduction, to provide a…

We show that the inverse limit of the graded algebras of local unitary invariant polynomials of finite dimensional k-partite quantum systems is free, and give an algebraically independent generating set. The number of degree 2d invariants…

The concept of a fully interlacing matrix of formal power series with real coefficients is introduced. This concept extends and strengthens that of an interlacing sequence of real-rooted polynomials with nonnegative coefficients, in the…

Let $\nu_d : \mathbb{P}^n \longrightarrow \mathbb{P}^N$ be the Veronese mapping of degree $d$ where $N = {n+d \choose n} -1$. By an elementary approach it is shown that $\nu_d$ is an isomorphism of $\mathbb{P}^n$ onto the projective variety…

We prove that r independent homogeneous polynomials of the same degree d become dependent when restricted to any hyperplane if and only if their inverse system parameterizes a variety whose (d-1)-osculating spaces have dimension smaller…

Consider some non-zero complex numbers $a_i, b_i, c_i, d_i$ with $1 \leq i \leq n$ and the associated classical Lotka-Volterra systems \[ \begin{cases} x' = a_i xy + b_i y \newline y' = c_i xy + d_i y \text{ .} \end{cases} \] We show that…

The independence number of a hypergraph H is the size of a largest set of vertices containing no edge of H. In this paper, we prove new sharp bounds on the independence number of n-vertex (r+1)-uniform hypergraphs in which every r-element…

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…

Veronese powers of operads were introduced in 2020 By Dotsenko, Markl, and Remm \cite{DMR}. The $m$-th Veronese power of a weight-graded operad $\mathcal{V}$ is the suboperad $\mathcal{V}^{[m]}$ generated by the operations of weight $m$. If…

Given $k \ge 2$ polynomials in $d \ge 1$ variables with coefficients in a field of characteristic $0$, such that no two are linearly dependent, we show that for any integer $r$ greater than $\max\left\{k {k-1 \choose 2}, 2\right\}$, the…

The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in particular, under the strong graph product. We show that the series of independence numbers in strong powers of a fixed…

In this paper, it is shown that for a minimal system $(X,T)$ and $d,k\in \mathbb{N}$, if $(x,x_i)$ is regionally proximal of order $d$ for $1\leq i\leq k$, then $(x,x_1,\ldots,x_k)$ is $(k+1)$-regionally proximal of order $d$. Meanwhile, we…

We study the problems of bounding the number weak and strong independent sets in $r$-uniform, $d$-regular, $n$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…