首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We examine a version of the Universal Number Partition Problem with a divisibility property referred to as the Universal Shelf Packing Problem (USPP). We show that if a shelf length is a product of powers of two primes the USPP is always partitionable. In the case where the shelf length is a product of three distinct primes we propose an efficient scheme to determine when such a case is not partitionable. We also show that a shelf length that is a product of powers of four or more primes always has at least one partition failure. Our analysis uses elementary number theory, known results related to the linear Diophantine Frobenius problem, and a new result on Frobenius gaps.  相似文献   

2.
Frobenius integrable decompositions are presented for a kind of ninth-order partial differential equations of specific polynomial type. Two classes of such partial differential equations possessing Frobenius integrable decompositions are connected with two rational Bäcklund transformations of dependent variables. The presented partial differential equations are of constant coefficients, and the corresponding Frobenius integrable ordinary differential equations possess higher-order nonlinearity. The proposed method can be also easily extended to the study of partial differential equations with variable coefficients.  相似文献   

3.
Hilbert's Tenth Problem(HTP) asks for an algorithm to test whether an arbitrary polynomial Diophantine equation with integer coefficients has solutions over the ring Z of integers.This was finally solved negatively by Matiyasevich in 1970.In this paper we obtain some further results on HTP over Z.We prove that there is no algorithm to determine for any P(z_1,...,z_9) ∈ Z[z_1,...,z_9] whether the equation P(z_1,...,z_9)=0 has integral solutions with z_9≥0.Consequently,there is no algorithm to test whether an arbitrary polynomial Diophantine equation P(z_1,...,z_(11))=0(with integer coefficients) in 11 unknowns has integral solutions,which provides the best record on the original HTP over Z.We also prove that there is no algorithm to test for any P(z_1,...,z_(17))∈Z[z_1,...,z_(17)] whether P(z_1,...,z_(17))=0 has integral solutions,and that there is a polynomial Q(z_1,...,z_(20))∈Z[z_1,...,z_(20)] such that {Q(z_1~2,...,z_(20)~2):z_1,...,z_(20)∈Z}∩ {0,1,2,...} coincides with the set of all primes.  相似文献   

4.
《Journal of Complexity》1997,13(2):279-300
This paper presents results connected with the theory of computation over the reals, developed recently by Blum, Shub, and Smale. The subjects of our investigation are variations of the well known Integer Linear Programming Problem and the Linear Diophantine Equation, where the coefficients are real numbers and we look for an integer solution. We show some results concerning the solvability and complexity of these problems, and we develop algorithms for their solution in the presence of additional information.  相似文献   

5.
Frobenius expansions are representations of integers to an algebraic base which are sometimes useful for efficient (hyper)elliptic curve cryptography. The normal form of a Frobenius expansion is the polynomial with integer coefficients obtained by reducing a Frobenius expansion modulo the characteristic polynomial of Frobenius. We consider the distribution of the coefficients of reductions of Frobenius expansions and non-adjacent forms of Frobenius expansions (NAFs) to normal form. We give asymptotic bounds on the coefficients which improve on naive bounds, for both genus one and genus two. We also discuss the non-uniformity of the distribution of the coefficients (assuming a uniform distribution for Frobenius expansions).  相似文献   

6.
Classically, the exponent of a group is the least common multiple of the orders of its elements. This notion was generalized by Etingof and Gelaki to Hopf algebras. Kashina, Sommerhäuser, and Zhu later observed that there is a strong connection between exponents and Frobenius–Schur indicators. In this article, we introduce the notion of twisted exponents and show there is a similar relationship between the twisted exponent and the twisted Frobenius–Schur indicators defined in previous work of the authors. In particular, we exhibit a new formula for the twisted indicators and use it to prove periodicity and rationality statements.  相似文献   

7.
We give a necessary and sufficient condition for the existence of a tree of order n with a given degree set. We relate this to a well-known linear Diophantine problem of Frobenius.  相似文献   

8.
Let A and C denote real n × n matrices. Given real n-vectors x1, ... ,xm, m ≤ n, and a set of numbers L = {λ1,λ2,... ,λm}. We describe (I) the set (?) of all real n × n bisymmetric positive seidefinite matrices A such that Axi is the "best" approximate to λixi, i = 1,2,...,m in Frobenius norm and (II) the Y in set (?) which minimize Frobenius norm of ||C - Y||.An existence theorem of the solutions for Problem I and Problem II is given and the general expression of solutions for Problem I is derived. Some sufficient conditions under which Problem I and Problem II have an explicit solution is provided. A numerical algorithm of the solution for Problem II has been presented.  相似文献   

9.
矩阵方程AX=B的双反对称最佳逼近解   总被引:1,自引:0,他引:1  
本文主要讨论下而两个问题并得到相关结果:问题Ⅰ:给定A ∈ R~(k×n),B ∈ R~(k×n),求X ∈ BASR~(n×n),使得AX=B.问题Ⅱ:给定X* ∈R~(n×n),求X使得‖X-X~*‖=minX∈S_E‖X-X~*‖,其中S_E是问题Ⅰ的解集合,‖·‖是Frobenius范数.通过对上述问题的讨论给出了问题Ⅰ解存在的充分必要条件和其解的一般表达式同时给出了问题Ⅱ的解,算法,和数值例子.  相似文献   

10.
Summary The paper deals with the generalisation of a formula for the Bessel coefficients which has been found byNeumann andLommel.Summation of products of Bessel functions the order of which is given by a linear Diophantine equation is performed with the aid of an integral representation. The obtained integrals can be used for series expansions and axymptotic approximations. The results are applied to the calculation of frequency modulation distortion caused by multipath transmission.  相似文献   

11.
双对称矩阵逆特征值问题解存在的条件   总被引:11,自引:1,他引:11  
胡锡炎  张磊  谢冬秀 《计算数学》1998,20(4):409-418
This paper discuss the following two problems:Problem I. Given . Find A,such thatAX=XA,where BSRn×n is the set of all n × n bisymmetric matrices.Problem II. Given Find A SE such that where SE is the solution set of Problem I,is the Frobenius norm.In this paper, the sufficient and necessary conditions under which SE is nonempty are obtained. The general form of SE has been given. Then expression of the solution A of Problem II is presented.  相似文献   

12.
The isomonodromic tau function of the Fuchsian differential equations associated to Frobenius structures on Hurwitz spaces can be viewed as a section of a line bundle on the space of admissible covers. We study the asymptotic behavior of the tau function near the boundary of this space and compute its divisor. This yields an explicit formula for the pullback of the Hodge class to the space of admissible covers in terms of the classes of compactification divisors.  相似文献   

13.
14.
The family of Diophantine difference equations considered byJ. H. Conway, H. T. Croft, P. Erds and M. J. T. Guy can be solvedin closed form when the parameter is a prime. The associatedcharacterisation problem is shown to be related to the determinationof certain constants, which also happen to be coefficients inthe asymptotic formula for the associated exponential sum.  相似文献   

15.
We give an iterative method to realize general Jack functions using vertex operators. We first prove some cases of Stanley’s conjecture on positivity of the Littlewood–Richardson coefficients, and then use this method to give a new realization of Jack functions. We also show in general that the images of coefficients of products of Jack vertex operators form a basis of symmetric functions. In particular, this gives a new proof of linear independence for the rectangular and marked rectangular Jack vertex operators. Finally, a generalized Frobenius formula for Jack functions is given and used for evaluation of Dyson integrals and even powers of Vandermonde determinants.  相似文献   

16.
《Discrete Mathematics》2007,307(11-12):1506-1515
General angular momentum recoupling coefficients can be expressed as a summation formula over products of 6-j coefficients. Yutsis, Levinson and Vanagas developed graphical techniques for representing the general recoupling coefficient as a cubic graph and they describe a set of reduction rules allowing a stepwise generation of the corresponding summation formula. This paper gives an overview of the state-of-the-art heuristic algorithms, used in the latest version of our GYutsis program, for calculating general recoupling coefficients. By means of an experimental setup we show that, in particular for problems of higher order, this approach yields summation formulae which are at least as good, but are often more concise than those obtained by previous algorithms. We also give a counter-example showing that the widespread convention of reducing girth cycles first does not always lead to a shortest reduction.  相似文献   

17.
This paper presents an approach which is useful for regression analysis in the case of heterogeneity of a set of observations, for which regression is evaluated. The proposed procedure consists of two stages. First, for a set of observations, fuzzy classification is determined. Due to this, homogenous classes of observations which are of hyperellipsoidal shape, are obtained. Then for each fuzzy class, the so called linear fuzzy regression is evaluated.

In the paper the method of calculating linear fuzzy regression coefficients is given. It is a generalized version of the least squares method. The formula for the values of coefficients is given. Some properties of linear fuzzy regression are analyzed. It is proved that in one- and two-dimensional cases, the formulae are analogous to those for usual regression. A measure of goodness-of-fit and the method of determination of the number of fuzzy classes are also given.

Presented examples indicate the superiority of fuzzy regression in comparison to usual regression in the case of heterogenous observations.  相似文献   


18.
We study the set of integers with a given sum of digits with respect to a linear recurrent digit system. An asymptotic formula for the number of integers ≤N with given sum of digits is determined, and the distribution in residue classes is investigated, thus generalizing results due to Mauduit and Sárközy. It turns out that numbers with fixed sum of digits are uniformly distributed in residue classes under some very general conditions. Namely, the underlying linear recurring sequence must have the property that there is no prime factor P of the modulus such that all but finitely many members of the sequence leave the same residue modulo P. The key step in the proof is an estimate for exponential sums using known theorems from Diophantine approximation.  相似文献   

19.
Consider the Frobenius Problem: Given positive integersa 1,...,a n witha i 2 and such that their greatest common divisor is one, find the largest natural number that is not expressible as a non-negative integer combination ofa 1,...,a n. In this paper we prove that the Frobenius problem is NP-hard, under Turing reductions.  相似文献   

20.
We study the exceptional case of the characteristic singular integral equation with Cauchy kernel in which its coefficients admit zeros or singularities of complex orders at finitely many points of the contour. By reduction to a linear conjugation problem, we obtain an explicit solution formula and solvability conditions for this equation in weighted Hölder classes.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号