共查询到20条相似文献,搜索用时 15 毫秒
2.
3.
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 . 相似文献
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
《Discrete Mathematics》2022,345(7):112898
The Hamming distance between two equal-length words u, v is the number of positions where u and v differ. The words u and v are said to be conjugates if there exist non-empty words such that and . The smallest value can take on is 0, when x and y commute. But, interestingly, the next smallest value can take on is 2 and not 1. In this paper, we consider conjugates and where . More specifically, we provide an efficient formula to count the number of length-n words over a k-letter alphabet that have a conjugate such that . We also provide efficient formulae for other quantities closely related to . Finally, we show that grows erratically: cubically for n prime, but exponentially for n even. 相似文献
18.
《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 . 相似文献
19.
Given a global function field K of characteristic p, for all effective divisors in the divisor group of K we count the number of cyclic extensions of degree p where the relative discriminant . 相似文献
20.