含四个参数的四次Thue方程

本文研究了含四个参数的四次Thue方程.利用简单的代数数有理逼近方法给出了该方程解的有效上界,从而将参数个数由两个推广到四个.     

Nonrepetitive vertex colorings of graphs

We prove new upper bounds on the Thue chromatic number of an arbitrary graph and on the facial Thue chromatic number of a plane graph in terms of its maximum degree.     

On algebraic approximations of certain algebraic numbers

Using hypergeometric functions and the Thue-Siegel method we give an effective improvement of Liouville's approximation theorem. As an application, we derive effective upper bounds for the solutions (X,Y) of the two-parametric family of quartic Thue inequalities

|BX4−AX3Y−6BX2Y2+AXY3+BY4|?N     

Determining the Monogeneity of a Quartic Number Field

This note presents a method that determines all power integral bases of a quartic number field by solving Thue equations of degrees 3 and 4. To this end, projective representations of the ring of integers by graded complete intersections are studied and a criterion for monogeneity in terms of projective representations is derived.     

Thue equations and CM-fields

We obtain a polynomial-type upper bounds for the size and the number of the integral solutions of Thue equations \(F(X,Y) = b\) defined over a totally real number field K, assuming that F(X, 1) has a root \(\alpha \) such that \(K(\alpha )\) is a CM-field. Furthermore, we give an algorithm for the computation of the integral solutions of such an equation.     

Thue inequalities with a small number of primitive solutions

Several upper bounds are known for the numbers of primitive solutions (x; y) of the Thue equation (1) j F(x; y) j = m and the more general Thue inequality (3) 0 < j F(x; y) j m. A usual way to derive such an upper bound is to make a distinction between "small" and "large" solutions, according as max( j x j ; j y j ) is smaller or larger than an appropriate explicit constant Y depending on F and m; see e.g. [1], [11], [6] and [2]. As an improvement and generalization of some earlier results we give in Section 1 an upper bound of the form cn for the number of primitive solutions (x; y) of (3) with max( j x j ; j y j )Y0 , wherec 25 is a constant and n denotes the degree of the binary form F involved (cf. Theorem 1). It is important for applications that our lower bound Y0 for the large solutions is much smaller than those in [1], [11], [6] and [4], and is already close to the best possible in terms of m. ByusingTheorem1 we establish in Section 2 similar upper bounds for the total number of primitive solutions of (3), provided that the height or discriminant of F is suficiently large with respect to m (cf. Theorem 2 and its corollaries). These results assert in a quantitative form that, in a certain sense, almost all inequalities of the form (3) have only few primitive solutions. Theorem 2 and its consequences are considerable improvements of the results obtained in this direction in [3], [6], [13] and [4]. The proofs of Theorems 1 and 2 are given in Section 3. In the proofs we use among other things appropriate modifications and refenements of some arguments of [1] and [6].     

Simplifying method for algebraic approximation of certain algebraic numbers

A new simple method for approximating certain algebraic numbers is developed. By applying this method, an effective upper bound is derived for the integral solutions of the quartic Thue equation with two parameters $tx^4 - 4sx^3 y - 6tx^2 y^2 + 4sxy^3 + ty^4 = N$ , where s > 32t ³. As an application, Ljunggren’s equation is solved in an elementary way.     

Best bounds on the distance between 3-direction quartic box spline surface and its control net

We present the best bounds on the distance between 3-direction quartic box spline surface patch and its control net by means of analysis and computing for the basis functions of 3-direction quartic box spline surface. Both the local bounds and the global bounds are given by the maximum norm of the first differences or second differences or mixed differences of the control points of the surface patch.     

Upper and Lower Bounds on Maximum Nonlinearity of n-input m-output Boolean Function

The paper presents lower and upper bounds on the maximumnonlinearity for an n-input m-output Booleanfunction. We show a systematic construction method for a highlynonlinear Boolean function based on binary linear codes whichcontain the first order Reed-Muller code as a subcode. We alsopresent a method to prove the nonexistence of some nonlinearBoolean functions by using nonexistence results on binary linearcodes. Such construction and nonexistence results can be regardedas lower and upper bounds on the maximum nonlinearity. For somen and m, these bounds are tighter than theconventional bounds. The techniques employed here indicate astrong connection between binary linear codes and nonlinear n-input m-output Boolean functions.     

Simple families of Thue inequalities

We use the hypergeometric method to solve three families of Thue inequalities of degree 3, 4 and 6, respectively, each of which is parametrized by an integral parameter. We obtain bounds for the solutions, which are astonishingly small compared to similar results which use estimates of linear forms in logarithms.

     

Approximation of conic section by quartic Bzier curve with endpoints continuity condition

A new method for approximation of conic section by quartic B′ezier curve is presented, based on the quartic B′ezier approximation of circular arcs. Here we give an upper bound of the Hausdorff distance between the conic section and the approximation curve, and show that the error bounds have the approximation order of eight. Furthermore, our method yields quartic G2 continuous spline approximation of conic section when using the subdivision scheme,and the effectiveness of this method is demonstrated by some numerical examples.     

On a Pseudorandom Property of Binary Sequences

C. Mauduit and A. Sárközy proposed the use of well-distribution measure and correlation measure as measures of pseudorandomness of finite binary sequences. In this paper we will introduce and study a further measure of pseudorandomness: the symmetry measure. First we will give upper and lower bounds for the symmetry measure. We will also show that there exists a sequence for which each of the well-distribution, correlation and symmetry measures are small. Finally we will compare these measures of pseudorandomness.     

带连续变利率风险模型最终破产概率上界

考虑了带二元连续变利息力的Sparre Andersen风险模型.研究了积累值盈余过程的表达式与性质;在利率递增环境下,利用推广后的调节系数方程组与递归技术推导了最终破产概率的上界,结论表明得到的破产概率上界是更为一般的Lundberg指数上界.     

三维广义磁流体方程组解的最优衰减率

本文利用Fourier分解法首次建立了三维广义磁流体动力学方程组弱解的时间衰减估计,得到了该方程解关于时间衰减的上下界估计,并且获得了相应的最优代数衰减率.     

Diophantine equations over global function fields I: The Thue equation

We solve completely Thue equations in function fields over arbitrary finite fields. In the function field case such equations were formerly only solved over algebraically closed fields (of characteristic zero and positive characteristic). Our method can be applied to similar types of Diophantine equations, as well.     

On the complexity of parabolic initial-value problems with variable drift

We study the intrinsic difficulty of solving linear parabolic initial-value problems numerically at a single point. We present a worst-case analysis for deterministic as well as for randomized (or Monte Carlo) algorithms, assuming that the drift coefficients and the potential vary in given function spaces. We use fundamental solutions (parametrix method) for equations with unbounded coefficients to relate the initial-value problem to multivariate integration and weighted approximation problems. Hereby we derive lower and upper bounds for the minimal errors. The upper bounds are achieved by algorithms that use Smolyak formulas and, in the randomized case, variance reduction. We apply our general results to equations with coefficients from Hölder classes, and here, in many cases, the upper and lower bounds almost coincide and our algorithms are almost optimal.     

On Perfect Codes: Rank and Kernel

We establish upper and lower bounds on the rank and the dimension of the kernel of perfect binary codes. We also establish some results on the structure of perfect codes.     

A PDE Approach to the Prediction of a Binary Sequence with Advice from Two History-Dependent Experts

The prediction of a binary sequence is a classic example of online machine learning. We like to call it the “stock prediction problem,” viewing the sequence as the price history of a stock that goes up or down one unit at each time step. In this problem, an investor has access to the predictions of two or more “experts,” and strives to minimize her final-time regret with respect to the best-performing expert. Probability plays no role; rather, the market is assumed to be adversarial. We consider the case when there are two history-dependent experts, whose predictions are determined by the d most recent stock moves. Focusing on an appropriate continuum limit and using methods from optimal control, graph theory, and partial differential equations, we discuss strategies for the investor and the adversarial market, and we determine associated upper and lower bounds for the investor's final-time regret. When d ≤ 4 our upper and lower bounds coalesce, so the proposed strategies are asymptotically optimal. Compared to other recent applications of partial differential equations to prediction, ours has a new element: there are two timescales, since the recent history changes at every step whereas regret accumulates more slowly. © 2022 Wiley Periodicals LLC.     

Alth?fer-Sillke不等式的改进（英）

在本文中给出二元向量空间的子集的平均Hamming距离的一个新的下界和上界，这些界对于二元向量空间的线性子空间是紧的，且改进了[2]文的Alth?fer- Sillke不等式，从而部分解决了Ahlswede和Katona在[1]中提出的一个问题.