Improved boolean formulas for the Ramsey graphs

In the theory of the random graphs, there are properties of graphs such that almost all graphs satisfy the property, but there is no effective way to find examples of such graphs. By the well-known results of Razborov, for some of these properties, e.g., some Ramsey property, there are Boolean formulas in ACC representing the graphs satisfying the property and having exponential number of vertices with respect to the number of variables of the formula. Razborov's proof is based on a probabilistic distribution on formulas of n variables of size approximately nd² log d, where d is a polynomial in n, and depth 3 in the basis { ∧, ⊕} with the following property: The restriction of the formula randomly chosen from the distribution to any subset A of the Boolean cube {0, 1}ⁿ of size at most d has almost uniform distribution on the functions A → {0, 1}. We show a modified probabilistic distribution on Boolean formulas which is defined on formulas of size at most nd log² d and has the same property of the restrictions to sets of size at most d as the original one. This allows us to obtain formulas the complexity of which is a polynomial of a smaller degree in n than in Razborov's paper while the represented graphs satisfy the same properties.     

Cubature Formulas of a Nonalgebraic Degree of Precision

We deal with cubature formulas that are exact for polynomials and also for polynomials multiplied by r, where r is the Euclidean distance to the origin. A general lower bound for the number of nodes for a specified degree of precision is given. This bound is improved for centrally symmetric integrals. A set of constraints (consistency conditions) is introduced for the construction of fully symmetric formulas. For one dimension and arbitrary degree, it is shown that the lower bound is sharp for centrally symmetric integrals. For higher dimensions, as an illustration, cubature formulas are only constructed for low degrees. March 6, 2000. Date revised: April 30, 2001. Date accepted: May 31, 2001.     

Simple Cubature Formulas with High Polynomial Exactness

We study cubature formulas for d -dimensional integrals with arbitrary weight function of tensor product form. We present a construction that yields a high polynomial exactness: for fixed degree, the number of knots depends on the dimension in an order-optimal way. The cubature formulas are universal: the order of convergence is almost optimal for two different scales of function spaces. The construction is simple: a small number of arithmetical operations is sufficient to compute the knots and the weights of the formulas. August 25, 1997. Date revised: December 3, 1998. Date accepted: March 3, 1999.     

The generation of formulas held in common knowledge

Common knowledge of a finite set of formulas implies a special relationship between syntactic and semantic common knowledge. If S, a set of formulas held in common knowledge, is implied by the common knowledge of some finite subset of S, and A is a non-redundant semantic model where exactly S is held in common knowledge, then the following are equivalent: (a) S is maximal among the sets of formulas that can be held in common knowledge, (b) A is finite, and (c) the set S determines A uniquely; otherwise there are uncountably many such A. Even if the knowledge of the agents are defined by their knowledge of formulas, 1) there is a continuum of distinct semantic models where only the tautologies are held in common knowledge and, 2) not assuming that S is finitely generated (a) does not imply (c), (c) does not imply (a), and (a) and (c) together do not imply (b). Received November 1999/Revised version January 2000     

A combinatorial formula for Macdonald polynomials

In this paper we use the combinatorics of alcove walks to give uniform combinatorial formulas for Macdonald polynomials for all Lie types. These formulas resemble the formulas of Haglund, Haiman and Loehr for Macdonald polynomials of type GLn. At q=0 these formulas specialize to the formula of Schwer for the Macdonald spherical function in terms of positively folded alcove walks and at q=t=0 these formulas specialize to the formula for the Weyl character in terms of the Littelmann path model (in the positively folded gallery form of Gaussent and Littelmann).     

Stochastic Differentiation – A Generalized Approach

The space (D ^*) of Wiener distributions allows a natural Pettis-type stochastic calculus. For a certain class of generalized multiparameter processes X: R ^N (D ^*) we prove several differentiation rules (Itô formulas); these processes can be anticipating. We then apply these rules to some examples of square integrable Wiener functionals and look at the integral versions of the resulting formulas.     

Distributive-Lattice Semantics of Sequent Calculi with Structural Rules

The goal of the paper is to develop a universal semantic approach to derivable rules of propositional multiple-conclusion sequent calculi with structural rules, which explicitly involve not only atomic formulas, treated as metavariables for formulas, but also formula set variables (viz., metavariables for finite sets of formulas), upon the basis of the conception of model introduced in (Fuzzy Sets Syst 121(3):27–37, 2001). One of the main results of the paper is that any regular sequent calculus with structural rules has such class of sequent models (called its semantics) that a rule is derivable in the calculus iff it is sound with respect to each model of the semantics. We then show how semantics of admissible rules of such calculi can be found with using a method of free models. Next, our universal approach is applied to sequent calculi for many-valued logics with equality determinant. Finally, we exemplify this application by studying sequent calculi for some of such logics.      

Extensions and renormalized traces

It has been shown by Nistor (Doc Math J DMV 2:263–295, 1997) that given any extension of associative algebras over \mathbb C{\mathbb C}, the connecting morphism in periodic cyclic homology is compatible, under the Chern–Connes character, with the index morphism in lower algebraic K-theory. The proof relies on the abstract properties of cyclic theory, essentially excision, which does not provide explicit formulas a priori. Avoiding the use of excision, we explain in this article how to get explicit formulas in a wide range of situations. The method is connected to the renormalization procedure introduced in our previous work on the bivariant Chern character for quasihomomorphisms Perrot (J Geom Phys 60:1441–1473, 2010), leading to “local” index formulas in the sense of non-commutative geometry. We illustrate these principles with the example of the classical family index theorem: we find that the characteristic numbers of the index bundle associated to a family of elliptic pseudodifferential operators are expressed in terms of the (fiberwise) Wodzicki residue.     

Interpolation of rational functions by simple partial fractions

We study a generalized interpolation of a rational function at n nodes by a simple partial fraction of degree n and reduce the consideration to the solvability question for a special difference equation. We construct explicit interpolation formulas in the case where the equation order is equal to 1. We show that for functions A(x − a) ^m , m ? \mathbbN m \in \mathbb{N} , it is possible to reduce the consideration to a system of m + 1 independent first order equations and construct explicit interpolation formulas. Bibliography: 6 titles.     

J. Simons' type integral formula for hypersurfaces in a unit sphere

In this paper, by investigating compact rotational hypersurfaces Mⁿ in a unit sphere Sⁿ⁺¹(1), we get some integral formulas and then apply the integral formulas to characterize torus .     

Exit problems associated with finite reflection groups

We obtain a formula for the distribution of the first exit time of Brownian motion from a fundamental region associated with a finite reflection group. In the type A case it is closely related to a formula of de Bruijn and the exit probability is expressed as a Pfaffian. Our formula yields a generalisation of de Bruijn’s. We derive large and small time asymptotics, and formulas for expected first exit times. The results extend to other Markov processes. By considering discrete random walks in the type A case we recover known formulas for the number of standard Young tableaux with bounded height.Mathematics Subject Classification (2000): 20F55, 60J65     

Recursive Formulas for the Generalized LM-Inverse of a Matrix

In this paper, we present recursive formulas for the sequential determination of the generalized LM-inverse of a general matrix. The formulas are developed for a matrix augmented by a column. These formulas are particularized to obtain also recursive relations for the generalized L-inverse of a general matrix augmented by a column.     

Optimale Quadraturformeln mit semidefiniten Peano-Kernen

Summary The remainder in numerical integration formulas can be represented asR(f)=cf ^(m) (), if and only if the associated Peano kernel is semidefinite. We investigate the question of optimal constantsc. Our existence theorems generalize a result of Schmeisser [12]. In addition we prove characterizing statements of optimal formulas. In particular we show: i) The Peano kernels have a maximal number of zeros. ii) The weights are positive and the inner knots have (implicitly) order two. iii) The formulas are of interpolatory type.     

Forking and Incomplete Types

Let Δ be a set of formulas. In this paper we study the following question: under what assumptions on Δ, the concept “a complete Δ-type p over B does not fork over A ? B” behaves well. We apply the results to the structure theory of ω₁-saturated models. Mathematics Subject Classification: 03C45.     

Index Reduction Formulas for Twisted Flag Varieties, II

This is a continuation of the determination begun in K-Theory 10 (1996), 517–596, of explicit index reduction formulas for function fields of twisted flag varieties of adjoint semisimple algebraic groups. We give index reduction formulas for the varieties associated to the classical simple groups of outer type A _n-1 and D _n, and the exceptional simple groups of type E ₆ and E ₇. We also give formulas for the varieties associated to transfers and direct products of algebraic groups. This allows one to compute recursively the index reduction formulas for the twisted flag varieties of any semi-simple algebraic group.     

Axiomatization of local-global principles for pp-formulas in spaces of orderings

We use a model theoretic approach to investigate properties of local-global principles for positive primitive formulas in spaces of orderings, such as the existence of bounds and the axiomatizability of local-global principles. As a consequence we obtain various classes of special groups satisfying local-global principles for all positive primitive formulas, and we show that local-global principles are preserved by some natural constructions in special groups.Mathematics Subject Classification (2000): 11E81, 03C65Acknowledgement This research was undertaken while both authors were partially suported by the European RTN Network (HPRN-CT-2001-00271) on real algebraic and analytic geometry.     

Schubert polynomials and Bott-Samelson varieties

Schubert polynomials generalize Schur polynomials, but it is not clear how to generalize several classical formulas: the Weyl character formula, the Demazure character formula, and the generating series of semistandard tableaux. We produce these missing formulas and obtain several surprising expressions for Schubert polynomials.?The above results arise naturally from a new geometric model of Schubert polynomials in terms of Bott-Samelson varieties. Our analysis includes a new, explicit construction for a Bott-Samelson variety Z as the closure of a B-orbit in a product of flag varieties. This construction works for an arbitrary reductive group G, and for G = GL(n) it realizes Z as the representations of a certain partially ordered set.?This poset unifies several well-known combinatorial structures: generalized Young diagrams with their associated Schur modules; reduced decompositions of permutations; and the chamber sets of Berenstein-Fomin-Zelevinsky, which are crucial in the combinatorics of canonical bases and matrix factorizations. On the other hand, our embedding of Z gives an elementary construction of its coordinate ring, and allows us to specify a basis indexed by tableaux. Received: November 27, 1997     

A 0-stable linear multistep formulas of theα-type

The-type linear multistep formulas are a generalization of the Adams-type formulas. This paper is concerned with completely characterizing theA ₀-stability of thek-step, orderk -type formulas. Specifically, all such formulas of orders 4 or less are identified and it is shown that no-type formulas of order 5 or more exist. These theorems generalize some previous results.     

High‐order algorithms for Riesz derivative and their applications (V)

In this article, based on the idea of combing symmetrical fractional centred difference operator with compact technique, a series of even‐order numerical differential formulas (named the fractional‐compact formulas) are established for the Riesz derivatives with order . Properties of coefficients in the derived formulas are studied in details. Then applying the constructed fourth‐order formula, a difference scheme is proposed to solve the Riesz spatial telegraph equation. By the energy method, the constructed numerical algorithm is proved to be stable and convergent with order , where τ and h are the temporal and spatial stepsizes, respectively. Finally, several numerical examples are presented to verify the theoretical results.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1754–1794, 2017