Results 31 to 40 of about 143,397 (296)
Nowhere-Zero Unoriented 6-Flows on Certain Triangular Graphs
Discussiones Mathematicae Graph Theory, 2022 A nowhere-zero unoriented flow of graph G is an assignment of non-zero real numbers to the edges of G such that the sum of the values of all edges incident with each vertex is zero. Let k be a natural number.
Yang Fan, Li Liangchen, Zhou Sizhong
doaj +1 more source
Zero-sum subsequences in bounded-sum {−1,1}-sequences [PDF]
Journal of Combinatorial Theory, Series A, 2019 The following result gives the flavor of this paper: Let $t$, $k$ and $q$ be integers such that $q\geq 0$, $0\leq t < k$ and $t \equiv k \,({\rm mod}\, 2)$, and let $s\in [0,t+1]$ be the unique integer satisfying $s \equiv q + \frac{k-t-2}{2} \,({\rm mod} \, (t+2))$. Then for any integer $n$ such that \[n \ge \max\left\{k,\frac{1}{2(t+2)}k^2 + \frac{
Yair Caro +2 more
openaire +2 more sources
Local transformations with a singular wavelet
Informatika, 2020 The paper considers a local wavelet transform with a singular basis wavelet. The problem of nonparametric approximation of a function is solved by the use of the sequence of local wavelet transforms.
V. M. Romanchak
doaj +1 more source
ON THE INDEX-CONJECTURE ON LENGTH FOUR MINIMAL ZERO-SUM SEQUENCES [PDF]
International Journal of Number Theory, 2013 Let G be a finite cyclic group. Every sequence S over G can be written in the form S = (n1g)⋅…⋅(nlg) where g ∈ G and n1,…,nl ∈ [1, ord (g)], and the index ind (S) of S is defined to be the minimum of (n1 +⋯+ nl)/ ord (g) over all possible g ∈ G such that 〈g〉 = G.
Shen, Caixia, Xia, Limeng
openaire +6 more sources
Iterative Approximations for Zeros of Sum of Accretive Operators in Banach Spaces
Journal of Function Spaces, 2016 We study the approximation of zero for sum of accretive operators using a modified Mann type forward-backward splitting algorithm and obtain strong convergence of the sequence generated by our scheme to the zero of sum of accretive operators in uniformly
Yekini Shehu
doaj +1 more source
On Subsequence Sums of a Zero-sum Free Sequence [PDF]
The Electronic Journal of Combinatorics, 2007 Let $G$ be a finite abelian group with exponent $m$, and let $S$ be a sequence of elements in $G$. Let $f(S)$ denote the number of elements in $G$ which can be expressed as the sum over a nonempty subsequence of $S$. In this paper, we show that, if $|S|=m$ and $S$ contains no nonempty subsequence with zero sum, then $f(S)\geq 2m-1$.
openaire +2 more sources
Frontiers in Energy Research, 2023 This paper proposes a two-person multi-stage zero-sum game model considering the confrontation between cascading failures and control strategies in an AC/DC hybrid system to solve the blocking problem of DC systems caused by successive failures at the ...
Xiangli Deng +4 more
doaj +1 more source
IEEE Access, 2020 This paper considers the problem of downlink (DL) training sequence design with limited coherence time for frequency division duplex (FDD) massive MIMO systems in a general scenario of single-stage precoding and distinct spatial correlations between ...
Muntadher Qasim Alsabah +2 more
doaj +1 more source
Discrete Dynamics in Nature and Society, 2021 This paper considers the combination of the general sum-of-processing-time effect and position-dependent effect on a single machine. The actual processing time of a job is defined by functions of the sum of the normal processing times of the jobs ...
Kunping Shen, Yuke Chen, Shangchia Liu
doaj +1 more source
REMARKS ON TINY ZERO-SUM SEQUENCES
, 2014 See the abstract in the attached ...
Yushuang Fan +4 more
openaire +4 more sources