A d-uniform hypergraph is a sum hypergraph iff there is a finite S ⊆ IN⁺ such that is isomorphic to the hypergraph ${⁺}_d\left(S\right)=(V,)$, where V = S and $=v₁,...,v_d:\left(i\ne j\Rightarrow v_i\ne v_j\right)\wedge {\sum }_{i=1}^d{v}_i\in S$. For an arbitrary d-uniform hypergraph the sum number σ = σ() is defined to be the minimum number of isolated vertices $w₁,...,w_{\sigma }\notin V$ such that $\cup w₁,...,w_{\sigma }$ is a sum hypergraph. In this paper, we prove $\sigma {(}_{n₁,...,n_d}^d)=1+{\sum }_{i=1}^d(n_i-1)+min0,\lceil 1/2({\sum }_{i=1}^{d-1}(n_i-1)-n_d)\rceil$, where ${}_{n₁,...,n_d}^d$ denotes the d-partite complete hypergraph; this generalizes the corresponding result of Hartsfield and Smyth [8] for complete bipartite graphs.

Let $p$ be an odd prime, and let $a$ be an integer not divisible by $p$. When $m$ is a positive integer with $p\equiv 1(mod2m)$ and $2$ is an $m$th power residue modulo $p$, we determine the value of the product ${\prod }_{k\in R_m\left(p\right)}(1+tan(\pi ak/p))$, where $$R_m\left(p\right)=\{0<k<p:k\in \mathbb{Z}\text{is}\text{an}m\text{th}\text{power}\text{residue}\text{modulo}p\}.$$ In particular, if $p=x^2+64y^2$ with $x,y\in \mathbb{Z}$, then $$\prod _{k\in R_4\left(p\right)}\left(1+tan\pi \frac{ak}{p}\right)={(-1)}^y{(-2)}^{(p-1)/8}.$$

For a positive integer k, a total k-dominating function of a digraph D is a function f from the vertex set V(D) to the set 0,1,2, ...,k such that for any vertex v ∈ V(D), the condition ${\sum }_{u\in N^{-}\left(v\right)}f\left(u\right)\ge k$ is fulfilled, where N¯(v) consists of all vertices of D from which arcs go into v. A set $f₁,f₂,...,f_d$ of total k-dominating functions of D with the property that ${\sum }_{i=1}^d{f}_i\left(v\right)\le k$ for each v ∈ V(D), is called a total k-dominating family (of functions) on D. The maximum number of functions in a total k-dominating family on D is the total k-domatic...

In [30], Kronrod proves that the connected components of isolevel sets of a continuous function can be endowed with a tree structure. Obviously, the connected components of upper level sets are an inclusion tree, and the same is true for connected components of lower level sets. We prove that in the case of semicontinuous functions, those trees can be merged into a single one, which, following its use in image processing, we call “tree of shapes”. This permits us to solve a classical representation...

In [CITE], Kronrod proves that the connected components of isolevel sets of a continuous function can be endowed with a tree structure. Obviously, the connected components of upper level sets are an inclusion tree, and the same is true for connected components of lower level sets. We prove that in the case of semicontinuous functions, those trees can be merged into a single one, which, following its use in image processing, we call “tree of shapes”. This permits us to solve a classical representation problem...