Related papers: Waring numbers over finite commutative local rings

We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…

In this paper we study Weyl sums over friable integers (more precisely $y$-friable integers up to $x$ when $y = (\log x)^C$ for a large constant $C$). In particular, we obtain an asymptotic formula for such Weyl sums in major arcs,…

On the Waring's problems for matrices over a commutative ring, there are some trace conditions provided for matrices eligibly expressed as a sum of $k$-th powers with $k=2,3,4,5,6,7,8$ in several literatures. In this paper, we provide the…

In this paper, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (locally) in order to destroy P. Estimating the resilience leads to…

Let $S=S_1S_2S_3\ldots S_n$ be a finite string. Write $S$ in the form $XYY\ldots Y=XY^k$, consisting of a prefix $X$ (which may be empty), followed by $k$ copies of a non-empty string $Y$. Then, the greatest value of this integer $k$ is…

The Matrix Waring problem is if we can write every matrix as a sum of $k$-th powers. Here, we look at the same problem for triangular matrix algebra $T_n(\mathbb{F}_q)$ consisting of upper triangular matrices over a finite field. We prove…

Given a group G, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of G where each element of the generating set is chosen independently at random with probability p. In this article we show that for any…

For integers r and k > 0(k>r),a conditional (k, r)-coloring of a graph G is a proper k-coloring of G such that every vertex v of G has at least min{r,d(v)} differently colored neighbors, where d(v) is the degree of v. In this note, for…

We obtain some new upper bounds on the Ramsey numbers of the form $R(\underbrace{C_4,\ldots,C_4}_m,G_1,\ldots,G_n)$, where $m\ge 1$ and $G_1,\ldots,G_n$ are arbitrary graphs. We focus on the cases of $G_i$'s being complete, star $K_{1,k}$…

In this article, we introduce a new graph theoretic structure associated with a finite commutative ring, called nil clean divisor graph. For a ring $R$, nil clean divisor graph is denoted by $G_N(R)$, where the vertex set is $\{x\in R\,:\,…

Let $k \ge 3$ be a fixed integer. We exactly determine the asymptotic distribution of $\ln Z_k(G(n,m))$, where $Z_k(G(n,m))$ is the number of $k$-colourings of the random graph $G(n,m)$. A crucial observation to this aim is that the…

Flip graphs are graphs on combinatorial objects in which the adjacency relation reflects a local change in the underlying objects. In this thesis we introduce Yoke graphs, a family of flip graphs that generalizes previously studied families…

Let $(R, \frak m)$ denote a local Cohen-Macaulay ring and $I$ a non-nilpotent ideal of $R$. The purpose of this article is to investigate Faltings' finiteness dimension $f_I(R)$ and equidimensionalness of certain homomorphic image of $R$.…

We study higher order determinantal varieties obtained by considering generic $m\times n$ ($m \le n$) matrices over rings of the form $F[t]/(t^k)$, and for some fixed $r$, setting the coefficients of powers of $t$ of all $r \times r$ minors…

In the symmetric group Sym(n) with n at least 5 let H be a conjugacy class of elements of order 2 and let \Gamma be the Cayley graph whose vertex set is the group G generated by H (so G is Sym(n) or Alt(n)) and whose edge set is determined…

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

In this paper we compute the Waring rank of any polynomial of the form F=M_1+...+M_r, where the M_i are pairwise coprime monomials, i.e., GCD(M_i,M_j)=1 for i not j. In particular, we determine the Waring rank of any monomial. As an…

Given two graphs $F$ and $G$, an $F$-WORM coloring of $G$ is an assignment of colors to its vertices in such a way that no $F$-subgraph of $G$ is monochromatic or rainbow. If $G$ has at least one such coloring, then it is called $F$-WORM…

Let $R$ be a commutative ring with identity. The co-maximal ideal graph of $R$, denoted by $\Gamma(R)$, is a simple graph whose vertices are proper ideals of $R$ which are not contained in the Jacobson radical of $R$ and two distinct…

For a graph $G$ and a positive integer $k$, the {\em graphical Stirling number} $S(G,k)$ is the number of partitions of the vertex set of $G$ into $k$ non-empty independent sets. Equivalently it is the number of proper colorings of $G$ that…