Residues Without Duality

The aim of this paper is to suggest an approach of constructing a residue theory. In particular, this approach may be used in case of infinite dimension of an algebra of differential forms. The results of the paper was announced without proofs in Uspekhi Mat. Nauk 35(2) (1980), 203–204.     

Generalized Quasi-Variational Inequalities Without Continuities

Given a nonempty set and two multifunctions , we consider the following generalized quasi-variational inequality problem associated with X, : Find such that . We prove several existence results in which the multifunction is not supposed to have any continuity property. Among others, we extend the results obtained in Ref. 1 for the case (x(X.     

Residually Small Varieties Without Rank

Subdirect representations are investigated in varieties which are defined by operations of not necessarily finite arity. It is shown that, in this context, Birkhoff's Subdirect Representation Theorem does not hold. However, a class of unranked varieties is identified which admit subdirect representations by subdirectly irreducibles and are even residually small.     

Smooth Surjections Without Surjective Restrictions

Let f:E→F be a surjective mapping between two real or complex Banach spaces, with f having some strong differentiability properties. We investigate when there is a smaller Banach space G?E such that the restriction of f to G remains surjective.     

Reducing Bias Without Prejudicing Sign

Jackknife and bootstrap bias corrections are based on a differencing argument which does not necessarily respect the sign of the true parameter value. Depending on sampling variability they can over-correct, producing a final estimator that is negative when one knows on physical grounds that it should be positive. To overcome this problem we suggest a simple, alternative bootstrap approach, based on biased-bootstrap methods. Our technique has similar properties to the standard uniform-bootstrap method in cases where the latter does not endanger sign, but it respects sign in a canonical way when the standard method disregards it.     

Conditional Gradient Method Without Line-Search

We propose a simple rule for the step-size choice in the conditional gradient method, which does not require any line-search procedure. It takes into account the current behavior of the method. Its convergence is established under the same assumptions as those for the previously known methods.     

On Graphs Without Multicliqual Edges

An edge which belongs to more than one clique of a given graph is called a multicliqual edge. We find a necessary and sufficient condition for a graph H to be the clique graph of some graph G without multicliqual edges. We also give a characterization of graphs without multicliqual edges that have a unique critical generator. Finally, it is shown that there are infinitely many self-clique graphs having more than one critical generator.     

Distributional Transformations Without Orthogonality Relations

Distributional transformations characterized by equations relating expectations of test functions weighted by a given biasing function on the original distribution to expectations of the test function’s higher derivatives with respect to the transformed distribution play a great role in Stein’s method and were, in great generality, first considered by Goldstein and Reinert (J Theoret Probab 18(1):237–260, 2005. doi: 10.1007/s10959-004-2602-6). We prove two abstract existence and uniqueness results for such distributional transformations, generalizing their \(X-P\)-bias transformation. On the one hand, we show how one can abandon previously necessary orthogonality relations by subtracting an explicitly known polynomial depending on the test function from the test function itself. On the other hand, we prove that for a given nonnegative integer m, it is possible to obtain the expectation of the m-th derivative of the test function with respect to the transformed distribution in the defining equation, even though the biasing function may have \(k<m\) sign changes, if these two numbers have the same parity. We explain how these results can be used to guarantee the existence of two different generalizations of the zero-bias transformation by Goldstein and Reinert (Ann Appl Probab 7(4):935–952, 1997. doi: 10.1214/aoap/1043862419). Further applications include the derivation of Stein-type characterizations without needing to solve any Stein equation and the presentation of a general framework for estimating the distance from the distribution of a given real random variable X to that of a random variable Z, whose distribution is characterized by some mth-order linear differential operator. We also explain the fact that, in general, the biased distribution depends on the choice of the sign change points, if these are ambiguous. This new phenomenon does not appear in the framework from Goldstein and Reinert (2005).     

Physics and Mathematics Without Coordinates

The author presents his views on how physics should be phrased in a coordinate-free manner. Examples are given, which range from classical Continuum Mechanics to Special and General Relativity, in a narrative that hinges on the author’s original contributions to these fields.     

一种非概率的利率模型

对于固定收益产品定价这个问题已经有很多种方法,将从另外一种角度来考虑这个问题,先通过T ay lor展开得到一个双曲型的偏微分方程,利用这个方程可以求出未定权益组合的最好最坏情景下的价格,然后再利用市场上已有的产品对此未定权益静态对冲,将会得到一个收益率曲线包络.     

Abelian Difference Sets Without Self-conjugacy

We obtain some results that are useful to the study of abelian difference sets and relative difference sets in cases where the self-conjugacy assumption does not hold. As applications we investigate McFarland difference sets, which have parameters of the form v=q^d+1( q^d+ q^d-1 +...+ q+2) ,k=q^d( q^d+q^d-1+...+q+1) , = q^d ( q^(d-1)+q^(d-2)+...+q+1), where q is a prime power andd a positive integer. Using our results, we characterize those abelian groups that admit a McFarland difference set of order k- = 81. We show that the Sylow 3-subgroup of the underlying abelian group must be elementary abelian. Our results fill two missing entries in Kopilovich's table with answer no.     

Tough Ramsey Graphs Without Short Cycles

A graph G is t-tough if any induced subgraph of it with x > 1 connected components is obtained from G by deleting at least tx vertices. It is shown that for every t and g there are t-tough graphs of girth strictly greater than g. This strengthens a recent result of Bauer, van den Heuvel and Schmeichel who proved the above for g = 3, and hence disproves in a strong sense a conjecture of Chvátal that there exists an absolute constant t ₀ so that every t ₀-tough graph is pancyclic. The proof is by an explicit construction based on the tight relationship between the spectral properties of a regular graph and its expansion properties. A similar technique provides a simple construction of triangle-free graphs with independence number m on (m ^4/3) vertices, improving previously known explicit constructions by Erdös and by Chung, Cleve and Dagum.     

非角截断的Fokker-Plank-Boltzmann方程

在非角截断条件下研究了Fokker-Plank-Boltzmann方程的Cauchy问题,从而推广了DiPerna和Lions在角截断假设下的经典结果.主要利用了碰撞算子的结构的一些性质,以及对正规化碰撞算子的一种新的分解,并结合准椭圆算子的性质,得到了非截断条件下重正规化解的稳定性,进而得到了解的存在性.     

Matrices Over Nondivision Algebras Without Eigenvalues

We are concerned with matrices over nondivision algebras and show by an example from an \({\mathbb{R}^{4}}\) algebra that these matrices do not necessarily have eigenvalues, even if these matrices are invertible. The standard condition for eigenvectors \({\rm x \neq 0}\) will be replaced by the condition that x contains at least one invertible component which is the same as \({\rm x \neq 0}\) for division algebras. The topic is of principal interest, and leads to the question what qualifies a matrix over a nondivision algebra to have eigenvalues. And connected with this problem is the question, whether these matrices are diagonalizable or triangulizable and allow a Schur decomposition. There is a last section where the question whether a specific matrix A has eigenvalues is extended to all eight \({\mathbb{R}^{4}}\) algebras by applying numerical means. As a curiosity we found that the considered matrix A over the algebra of tessarines, which is a commutative algebra, introduced by Cockle (Phil Mag 35(3):434–437, 1849; http://www.oocities.org/cocklebio/), possesses eigenvalues.     

一个无参数的填充函数算法

自从1990年Ge R.P.教授在文章【A Filled Function Method for Finding a Global Minimizer of a Function of Several Variables[J].Math.Programming,1990,46:191-204】中提出了求全局最优化的填充函数算法以来,此类算法的有效性一直受到调整参数的困扰,在上述文章最后他也期待出现无参数的填充函数.作为一种尝试,本文提出了一种新的无参数的填充函数,并在此基础上,构造出一个无参数填充函数算法.数值试验证明该算法是有效的,同时与已有的填充函数算法比较具有计算量小的优势.