共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
3.
We use character sums over finite fields to give formulas for the number of solutions of certain diagonal equations of the form We also show that if the value distribution of character sums , , is known, then one can obtain the number of solutions of the system of equations for some particular m. We finally apply our results to induce some facts about Waring's problems and the covering radius of certain cyclic codes. 相似文献
4.
5.
6.
7.
8.
Yoshihiro Asayama Yuki Kawasaki Seog-Jin Kim Atsuhiro Nakamoto Kenta Ozeki 《Discrete Mathematics》2018,341(11):2988-2994
An -dynamic -coloring of a graph is a proper -coloring such that any vertex has at least distinct colors in . The -dynamic chromatic number of a graph is the least such that there exists an -dynamic -coloring of .Loeb et al. (2018) showed that if is a planar graph, then , and there is a planar graph with . Thus, finding an optimal upper bound on for a planar graph is a natural interesting problem. In this paper, we show that if is a planar triangulation. The upper bound is sharp. 相似文献
9.
10.
11.
12.
13.
14.
Neel Patel 《Journal of Differential Equations》2018,264(3):1841-1885
We consider continuation criteria for the three-dimensional relativistic Vlasov–Maxwell system. When the particle density, , is compactly supported at , we prove , where and is arbitrarily small, is a continuation criteria. Our continuation criteria is an improvement in the range to the previously best known criteria due to Kunze [7]. We also consider continuation criteria when has noncompact support. In this regime, Luk–Strain [9] proved that is a continuation criteria for . We improve this result to . Finally, we build on another result by Luk–Strain [8]. The authors proved boundedness of momentum support on a fixed two-dimensional plane is a sufficient continuation criteria. We prove the same result even if the plane varies continuously in time. 相似文献
15.
《Discrete Mathematics》2007,307(7-8):964-970
The Moore bound for a directed graph of maximum out-degree d and diameter k is . It is known that digraphs of order (Moore digraphs) do not exist for and . Similarly, the Moore bound for an undirected graph of maximum degree d and diameter k is . Undirected Moore graphs only exist in a small number of cases. Mixed (or partially directed) Moore graphs generalize both undirected and directed Moore graphs. In this paper, we shall show that all known mixed Moore graphs of diameter are unique and that mixed Moore graphs of diameter do not exist. 相似文献
16.
17.
18.
Kazaros Kazarian 《Comptes Rendus Mathematique》2004,339(5):335-337
A complete orthonormal system of functions is constructed such that converges almost everywhere on if and diverges a.e. for any . We also show that for any complete ONS of functions defined on there exists a fixed non decreasing subsequence of natural numbers such that for any and some sequence of coefficients , To cite this article: K. Kazarian, C. R. Acad. Sci. Paris, Ser. I 339 (2004). 相似文献
19.
20.
Reza Mazrooei-Sebdani 《Communications in Nonlinear Science & Numerical Simulation》2012,17(10):3857-3865
Consider the following system of rational equations containing quadratic termsChaos in the sense of Li–Yorke is considered. This is based on the Marotto’s theorem via obtaining a snap-back repeller. In fact, first in a special case when , we show that origin is a snap-back repeller and so the system has chaotic behavior in the sense of Li–Yorke under some conditions. Then in a more general case, we prove that existence of chaos in the sense of Li–Yorke for the above system. 相似文献