共查询到20条相似文献,搜索用时 796 毫秒
1.
2.
3.
《Journal of Pure and Applied Algebra》2022,226(12):107140
We explore explicit virtual resolutions, as introduced by Berkesch, Erman, and Smith, for ideals of finite sets of points in . Specifically, we describe a virtual resolution for a sufficiently general set of points X in that only depends on . We also improve an existence result of Berkesch, Erman, and Smith in the special case of points in ; more precisely, we give an effective bound for their construction that gives a virtual resolution of length two for any set of points in . 相似文献
4.
5.
6.
7.
8.
9.
We compare Brouwer's bar theorem and Spector's bar recursion for the lowest type in the context of constructive reverse mathematics. To this end, we reformulate bar recursion as a logical principle stating the existence of a bar recursor for every function which serves as the stopping condition of bar recursion. We then show that the decidable bar induction is equivalent to the existence of a bar recursor for every continuous function from to with a continuous modulus. We also introduce fan recursion, the bar recursion for binary trees, and show that the decidable fan theorem is equivalent to the existence of a fan recursor for every continuous function from to with a continuous modulus. The equivalence for bar induction holds over the extensional version of intuitionistic arithmetic in all finite types augmented with the characteristic principles of Gödel's Dialectica interpretation. On the other hand, we show the equivalence for fan theorem without using such extra principles. 相似文献
10.
11.
A new a priori estimate for solutions to Navier–Stokes equations is derived. Uniqueness and existence of these solutions in for all is proved in a class of solutions locally differentiable in time with values in , where is the Sobolev space. By the solution a solution to an integral equation is understood. No smallness restrictions on the data are imposed. 相似文献
13.
《Discrete Mathematics》2020,343(3):111721
The -additive codes are subgroups of , and can be seen as a generalization of linear codes over and . A -linear Hadamard code is a binary Hadamard code which is the Gray map image of a -additive code. A partial classification of these codes by using the dimension of the kernel is known. In this paper, we establish that some -linear Hadamard codes of length are equivalent, once is fixed. This allows us to improve the known upper bounds for the number of such nonequivalent codes. Moreover, up to , this new upper bound coincides with a known lower bound (based on the rank and dimension of the kernel). Finally, when we focus on , the full classification of the -linear Hadamard codes of length is established by giving the exact number of such codes. 相似文献
14.
We study the Hénon–Lane–Emden conjecture, which states that there is no non-trivial non-negative solution for the Hénon–Lane–Emden elliptic system whenever the pair of exponents is subcritical. By scale invariance of the solutions and Sobolev embedding on , we prove this conjecture is true for space dimension ; which also implies the single elliptic equation has no positive classical solutions in when the exponent lies below the Hardy–Sobolev exponent, this covers the conjecture of Phan–Souplet [22] for . 相似文献
15.
We present several existence and nonexistence results for permutation binomials of the form , where and . As a consequence, we obtain a complete characterization of such permutation binomials over , , , , and , where p is an odd prime. 相似文献
17.
18.
19.
20.
As an application of the method of [4], we find the metric and connection on the space of conics in determined as the solution space of the ODE (1). These calculations underpin the twistor construction of the Radon transform on conics in described in [5]. Two further examples of the method are provided. 相似文献