共查询到20条相似文献,搜索用时 484 毫秒
1.
2.
Let χ be an order c multiplicative character of a finite field and a binomial with . We study the twisted classical and T-adic Newton polygons of f. When , we give a lower bound of Newton polygons and show that they coincide if p does not divide a certain integral constant depending on .We conjecture that this condition holds if p is large enough with respect to by combining all known results and the conjecture given by Zhang-Niu. As an example, we show that it holds for . 相似文献
3.
4.
5.
《Annales de l'Institut Henri Poincaré (C) Analyse Non Linéaire》2021,38(5):1337-1371
In this paper we consider minimizers of the functional where is a bounded open set and where are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets have finite perimeter and that their free boundary is composed of a regular part, which is locally the graph of a -regular function, and a singular part, which is empty if , discrete if and of Hausdorff dimension at most if , for some . 相似文献
6.
7.
8.
This paper deals with the chemotaxis-growth system: , , in a smooth bounded domain with zero-flux boundary conditions, where μ, δ, and τ are given positive parameters. It is shown that the solution exponentially stabilizes to the constant stationary solution in the norm of as provided that and any given nonnegative and suitably smooth initial data fulfills , which extends the condition in [8]. 相似文献
9.
10.
12.
13.
In this paper, we study the antipode of a finite-dimensional Hopf algebra H with the dual Chevalley property and obtain an annihilation polynomial for the antipode. This generalizes an old result given by Taft and Wilson in 1974. As consequences, we show that 1) the quasi-exponent of H is the same as the exponent of its coradical, that is, ; 2) . 相似文献
14.
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). 相似文献
15.
《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. 相似文献
16.
17.
19.