Weaving hadamard matrices with maximum excess and classes with small excess

Weaving is a matrix construction developed in 1990 for the purpose of obtaining new weighing matrices. Hadamard matrices obtained by weaving have the same orders as those obtained using the Kronecker product, but weaving affords greater control over the internal structure of matrices constructed, leading to many new Hadamard equivalence classes among these known orders. It is known that different classes of Hadamard matrices may have different maximum excess. We explain why those classes with smaller excess may be of interest, apply the method of weaving to explore this question, and obtain constructions for new Hadamard matrices with maximum excess in their respective classes. With this method, we are also able to construct Hadamard matrices of near‐maximal excess with ease, in orders too large for other by‐hand constructions to be of much value. We obtain new lower bounds for the maximum excess among Hadamard matrices in some orders by constructing candidates for the largest excess. For example, we construct a Hadamard matrix with excess 1408 in order 128, larger than all previously known values. We obtain classes of Hadamard matrices of order 96 with maximum excess 912 and 920, which demonstrates that the maximum excess for classes of that order may assume at least three different values. Since the excess of a woven Hadamard matrix is determined by the row sums of the matrices used to weave it, we also investigate the properties of row sums of Hadamard matrices and give lists of them in small orders. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 233–255, 2004.     

Gibbs partitions: The convergent case

We study Gibbs partitions that typically form a unique giant component. The remainder is shown to converge in total variation toward a Boltzmann‐distributed limit structure. We demonstrate how this setting encompasses arbitrary weighted assemblies of tree‐like combinatorial structures. As an application, we establish smooth growth along lattices for small block‐stable classes of graphs. Random graphs with n vertices from such classes are shown to form a giant connected component. The small fragments may converge toward different Poisson Boltzmann limit graphs, depending along which lattice we let n tend to infinity. Since proper addable minor‐closed classes of graphs belong to the more general family of small block‐stable classes, this recovers and generalizes results by McDiarmid (2009).     

Fundamental Classes in Algebraic Cobordism

We recall our construction of fundamental classes in the algebraic cobordism of smooth quasi-projective varieties, and show by example that it is not possible to extent this to fundamental classes, functorial for local complete intersection morphisms, for Cohen–Macaulay varieties.     

Cardinal splines in nonparametric regression

We discuss a nonparametric regression model on an equidistant grid of the real line. A class of kernel type estimates based on the so-called fundamental cardinal splines will be introduced. Asymptotic optimality of these estimates will be established for certain functional classes. This model explains the often mentioned heuristic fact that cubic splines are adequate for most practical applications.      

Categoricity in multiuniversal classes

The third author has shown that Shelah's eventual categoricity conjecture holds in universal classes: class of structures closed under isomorphisms, substructures, and unions of chains. We extend this result to the framework of multiuniversal classes. Roughly speaking, these are classes with a closure operator that is essentially algebraic closure (instead of, in the universal case, being essentially definable closure). Along the way, we prove in particular that Galois (orbital) types in multiuniversal classes are determined by their finite restrictions, generalizing a result of the second author.     

Inverse closed ultradifferential subalgebras

In previous work we have shown that classical approximation theory provides methods for the systematic construction of inverse-closed smooth subalgebras. Now we extend this work to treat inverse-closed subalgebras of ultradifferentiable elements. In particular, Carleman classes and Dales–Davie algebras are treated. As an application the result of Demko, Smith and Moss, and Jaffard on the inverse of a matrix with exponential decay is obtained within the framework of a general theory of smoothness.     

关于群类的Sylow性质

群类理论是在有限可解群研究工作的基础上发展起来的,但近年来对有限群论的许多方面都起到越来越大的作用.在考察群类性质时,注意到一个Fitting类(?)在可解群G中的(?)内射子具有Sylow子群所具有的某些性质,并且关于Sylow定理中(Sy13),证明了对于群的本原子群,成立更强的结论.     

Symmetry classes of spanning trees of Aztec diamonds and perfect matchings of odd squares with a unit hole

We say that two graphs are similar if their adjacency matrices are similar matrices. We show that the square grid G _n of order n is similar to the disjoint union of two copies of the quartered Aztec diamond QAD _n−1 of order n−1 with the path P _n ⁽²⁾ on n vertices having edge weights equal to 2. Our proof is based on an explicit change of basis in the vector space on which the adjacency matrix acts. The arguments verifying that this change of basis works are combinatorial. It follows in particular that the characteristic polynomials of the above graphs satisfy the equality P(G _n )=P(P _n ⁽²⁾)[P(QAD _n−1)]². On the one hand, this provides a combinatorial explanation for the “squarishness” of the characteristic polynomial of the square grid—i.e., that it is a perfect square, up to a factor of relatively small degree. On the other hand, as formulas for the characteristic polynomials of the path and the square grid are well known, our equality determines the characteristic polynomial of the quartered Aztec diamond. In turn, the latter allows computing the number of spanning trees of quartered Aztec diamonds. We present and analyze three more families of graphs that share the above described “linear squarishness” property of square grids: odd Aztec diamonds, mixed Aztec diamonds, and Aztec pillowcases—graphs obtained from two copies of an Aztec diamond by identifying the corresponding vertices on their convex hulls. We apply the above results to enumerate all the symmetry classes of spanning trees of the even Aztec diamonds, and all the symmetry classes not involving rotations of the spanning trees of odd and mixed Aztec diamonds. We also enumerate all but the base case of the symmetry classes of perfect matchings of odd square grids with the central vertex removed. In addition, we obtain a product formula for the number of spanning trees of Aztec pillowcases. Research supported in part by NSF grant DMS-0500616.     

格序群的极小扭类,准素扭类和极扭类

本文给出了格序群的扭类是准素扭类的一个充分必要条件，证明了任一非零扭类至少包含一个极小扭类，从而将文〔１〕和〔２〕中在有限制条件情况下的有关结论推广到无任何限制条件的情形。本文还给出了一个扭类是极扭类的几个充分必要条件，并得到了格序群的极扭类、准素扭类和极小扭类之间的关系。     

Equivalence for varieties in general and for $ {\cal BOOL} $ in particular

The varieties equivalent to a given variety are characterized in a purely categorical way. In fact they are described as the models of those Lawvere theories which are Morita equivalent to the Lawvere theory of which therefore are characterized first. Along this way the conceptual meanings of the n-th matrix power construction of a variety and McKenzie's σ-modification of classes of algebras [22] become transparent. Besides other applications not only the well known equivalences between the varieties of Post algebras of fixed orders m and the variety of Boolean algebras are obtained; moreover it can be shown that the varieties are the only varieties equivalent to . The results then are generalized to quasivarieties and more general classes of algebras. Received November 4, 1998; accepted in final form September 15, 1999.     

云计算在智能电网中的应用研究

随着现代电网规模的不断扩大,现有的电力系统网络越来越无法满足现代化建设发展的需求,具备自愈、互动、兼容等优点的智能电网成为未来电网的发展趋势.同时,智能电网概念的提出和逐步实现对电力系统的计算和存储能力提出了越来越高的要求.基于云计算技术并结合电力网络系统的特点,提出电力网络系统智能云的概念,在此基础上规划设计了电力系统智能云的体系结构并分析了电力系统智能云实现的关键技术.电力网络系统智能云技术的应用,能够在现有基础资源基本不变的情况下,大大提高电力网络系统的计算和存储能力,实现电力网络系统智能化、信息化和分级化的互动管理,减少电网建设投资,为构建现代化智能电网系统提供了明确的思路和研究方向.     

区间值信息系统上决策规则的获取与优化

以区间值信息系统上的变精度相容关系所确定的极大变精度相容类作为的基本知识,在相似水平不变的情形下,提出了极大变精度相容类的属性描述、相对约简、决策规则及相对最优决策规则等概念.最后,针对极大变精度相容类,定义了一种基于区分矩阵的区分函数,并通过计算区分函数的析取范式得到获取区间值信息系统相对最优决策规则的具体操作方法.     

AVERAGE ONESIDED WIDTHS OF SOBOLEV AND BESOV CLASSES

The article concerns the average onesided widths of the Sobolev and Besov classes and the classes of functions with bounded moduli of smoothness. The weak asymptotic results are obtained for the corresponding quantities.     

A characterization of mapping unstructured grids onto structured grids and using multigrid as a preconditioner

Many problems based on unstructured grids provide a natural multigrid framework due to using an adaptive gridding procedure. When the grids are saved, even starting from just a fine grid problem poses no serious theoretical difficulties in applying multigrid. A more difficult case occurs when a highly unstructured grid problem is to be solved with no hints how the grid was produced. Here, there may be no natural multigrid structure and applying such a solver may be quite difficult to do. Since unstructured grids play a vital role in scientific computing, many modifications have been proposed in order to apply a fast, robust multigrid solver. One suggested solution is to map the unstructured grid onto a structured grid and then apply multigrid to a sequence of structured grids as a preconditioner. In this paper, we derive both general upper and lower bounds on the condition number of this procedure in terms of computable grid parameters. We provide examples to illuminate when this preconditioner is a useful (e. g.,p orh-p formulated finite element problems on semi-structured grids) or should be avoided (e.g., typical computational fluid dynamics (CFD) or boundary layer problems). We show that unless great care is taken, this mapping can lead to a system with a high condition number which eliminates the advantage of the multigrid method. This work was partially supported by ONR Grant # N0014-91-J-1576.     

Enumerating indices of Schubert varieties defined by inclusions

By extending the notion of grid classes to include infinite grids, we establish a structural characterisation of the simple permutations in Av(4231,35142,42513,351624)$\mathrm{Av}(4231,35142,42513,351624)$, a pattern class which has three different connections with algebraic geometry, including the specification of indices of Schubert varieties defined by inclusions. This characterisation leads to the enumeration of the class.     

论有限群元素共轭类的平均长度

本文研究有限群元素共轭类的平均长度问题.利用初等群论方法和有限群特征标理论,在共轭类平均长度为某一定数时,获得了对有限群结构的刻划,且对有限群数量性质的研究是有意义的.     

Ultra‐differentiable classes and intersection theorems

The aim of the paper is to study the relation between ultra‐differentiable classes of functions defined in terms of estimates on derivatives on one hand and in terms of growth properties of Fourier transforms of suitably localized functions in the class on the other hand. We establish this relation for the ultra‐differentiable classes introduced in 6 , 16 , and show that the classes of 6 , 16 , can be regarded as inhomogeneous Gevrey classes in the sense of 22 . We also discuss a number of properties of the weight functions used to define the respective classes and of their Young conjugates.     

Multiblock matrix methods for solution of integrodifferential equations of (0, k) type

Easily implementable numerical-analytical (so-called matrix) methods are developed and analyzed for approximate solution of one-dimensional linear integrodifferential equations with constant integration limits containing a differential expression only in the integrand. Zero-rank matrix algorithms of numerical differentiation and integration are used for construction. The original equation is reduced to a linear algebraic vector equation for the values of the sought solution at the grid points and to an interpolation formula.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 55, pp. 69–75, 1985.     

Characterization of Hereditary Rings ViaInjectivity and Projectivity Classes

Throughout,allringsconsideredhaveanidentity,modulesareunitalleftmodulesandE(M)standsfortheinjectivehullofM.Now,letSbeaclassofmodules,thatisacollectionofR-modulessuchthatifM∈SthenanyR-moduleisomorphictoMbelongstoS.Wewillfreelyusethenotation,terminologyandresultsof[2].Recently,thereareanumberofwellknowntheoremswhichcharacterizeringsintermsofinjectiveandprojectivemodules(cf.[1],[3]and[4]).In[5,6]injectivityclassesandprojec-tivityclassesareintroducedandsimilarresultsremaintruewheninjectivity(…     

Decidability of Some Classes of Modal Logic

We describe a modal sequential calculus some modal rules of which do not contain duplications of the main formula. We also prove its equivalence to the modal calculus S4 and the decidability of some classes of formulas containing only oneplace predicate variables.