共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
5.
In this paper, we study the long-time behavior of solutions of a reaction–diffusion model in a one-dimensional river network, where the river network has two branches, and the water flow speeds in each branch are the same constant . We show the existence of two critical values and 2 with , and prove that when , the population density in every branch of the river goes to 1 as time goes to infinity; when , then, as time goes to infinity, the population density in every river branch converges to a positive steady state strictly below 1; when , the species will be washed down the stream, and so locally the population density converges to 0. Our result indicates that only if the water-flow speed is suitably small (i.e., ), the species will survive in the long run. 相似文献
6.
In this paper, we give the dimension and the minimum distance of two subclasses of narrow-sense primitive BCH codes over with designed distance for all , where q is a prime power and is a positive integer. As a consequence, we obtain an affirmative answer to two conjectures proposed by C. Ding in 2015. Furthermore, using the previous part, we extend some results of Yue and Hu [16], and we give the dimension and, in some cases, the Bose distance for a large designed distance in the range for , where if m is odd, and if m is even. 相似文献
7.
Yinan Guo 《Expositiones Mathematicae》2021,39(2):165-181
Analogs of Waring–Hilbert problem on Cantor sets are explored. The focus of this paper is on the Cantor ternary set . It is shown that, for each , every real number in the unit interval is the sum with each in and some . Furthermore, every real number in the interval can be written as , the sum of eight cubic powers with each in . Another Cantor set is also considered. More specifically, when is embedded into the complex plane , the Waring–Hilbert problem on has a positive answer for powers less than or equal to 4. 相似文献
8.
9.
10.
11.
Minimal blocking sets in have size at most . This result is due to Bruen and Thas and the bound is sharp, sets attaining this bound are called unitals. In this paper, we show that the second largest minimal blocking sets have size at most , if , , or , , . Our proof also works for sets having at least one tangent at each of its points (that is, for tangency sets). 相似文献
12.
13.
《Discrete Mathematics》2023,346(4):113304
In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size ? In this note, we improve upon a recent result of Frankl and resolve this problem for and . 相似文献
14.
《Discrete Mathematics》2020,343(10):111996
A Gallai coloring of a complete graph is an edge coloring without triangles colored with three different colors. A sequence of positive integers is an -sequence if . An -sequence is a G-sequence if there is a Gallai coloring of with colors such that there are edges of color for all . Gyárfás, Pálvölgyi, Patkós and Wales proved that for any integer there exists an integer such that every -sequence is a G-sequence if and only if . They showed that and .We show that and give almost matching lower and upper bounds for by showing that with suitable constants , for all sufficiently large . 相似文献
15.
16.
17.
We look for positive solutions for the singular equation where , , is a parameter, and has some summability properties. By using a perturbation method and critical point theory, we obtain two solutions when and the parameter is small. 相似文献
18.
In Korchmáros et al. (2018)one-factorizations of the complete graph are constructed for with any odd prime power such that either or . The arithmetic restriction is due to the fact that the vertices of in the construction are the points of a conic in the finite plane of order . Here we work on the Euclidean plane and describe an analogous construction where the role of is taken by a regular -gon. This allows us to remove the above constraints and construct one-factorizations of for every even . 相似文献
19.
《Annals of Pure and Applied Logic》2022,173(8):103135
We further develop a forcing notion known as Coding with Perfect Trees and show that this poset preserves, in a strong sense, definable P-points, definable tight MAD families and definable selective independent families. As a result, we obtain a model in which , each of , , has a witness and there is a well-order of the reals. Note that both the complexity of the witnesses of the above combinatorial cardinal characteristics, as well as the complexity of the well-order are optimal. In addition, we show that the existence of a well-order of the reals is consistent with and each of the following: , , , where the smaller cardinal characteristics have co-analytic witnesses.Our methods allow the preservation of only sufficiently definable witnesses, which significantly differs from other preservation results of this type. 相似文献
20.