Applications of autoreproducing kernel grammian moduli to S (U,H)-valued stationary random functions

It is shown that the analytical characterizations of q-variate interpolable and minimal stationary processes obtained by H. Salehi (Ark. Mat., 7 (1967), 305–311; Ark. Mat., 8 (1968), 1–6; J. Math. Anal. Appl., 25 (1969), 653–662), and later by A. Weron (Studia Math., 49 (1974), 165–183), can be easily extended to Hilbert space valued stationary processes when using the two grammian moduli that respectively autoreproduce their correlation kernel and their spectral measure. Furthermore, for these processes, a Wold-Cramér concordance theorem is obtained that generalizes an earlier result established by H. Salehi and J. K. Scheidt (J. Multivar. Anal., 2 (1972), 307–331) and by A. Makagon and A. Weron (J. Multivar. Anal., 6 (1976), 123–137).     

On the sign-imbalance of partition shapes

Let the sign of a standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. A conjecture by Richard Stanley says that the sum of the signs of all SYTs with n squares is 2^⌊n/2⌋. We present a stronger theorem with a purely combinatorial proof using the Robinson-Schensted correspondence and a new concept called chess tableaux.We also prove a sharpening of another conjecture by Stanley concerning weighted sums of squares of sign-imbalances. The proof is built on a remarkably simple relation between the sign of a permutation and the signs of its RS-corresponding tableaux.     

The Robinson-Schensted correspondence for skew oscillating semi-standard tableaux

We introduce an analogue of the Robinson-Schensted correspondence for skew oscillating semi-standard tableaux that generalizes the correspondence for skew oscillating standard tableaux. We give a geometric construction for skew oscillating semi-standard tableaux and examine its combinatorial properties.     

Rational tableaux and the tensor algebra of gln

A generalization of the usual column-strict tableaux (equivalent to a construction of R. C. King) is presented as a natural combinatorial tool for the study of finite dimensional representations of GL_n(C). These objects are called rational tableaux since they play the same role for rational representations of GL_n as ordinary tableaux do for polynomial representations. A generalization of Schensted's insertion algorithm is given for rational tableaux, and is used to count the. multiplicities of the irreducible GL_n-modules in the tensor algebra of GL_n. The problem of counting multiplicities when the kth tensor power gl_n^⊗k is decomposed into modules which are simultaneously irreducible with respect to GL_n and the symmetric group S_k is also considered. The existence of an insertion algorithm which describes this decomposition is proved. A generalization of border strip tableaux, in which both addition and deletion of border strips is allowed, is used to describe the characters associated with this decomposition. For large n, these generalized border strip tableaux have a simple structure which allows derivation of identities due to Hanlon and Stanley involving the (large n) decomposition of gl_n^⊗k.     

Properties of the nonsymmetric Robinson–Schensted–Knuth algorithm

We introduce a generalization of the Robinson–Schensted–Knuth insertion algorithm for semi-standard augmented fillings whose basement is an arbitrary permutation σ∈S _n . If σ is the identity, then our insertion algorithm reduces to the insertion algorithm introduced by the second author (Sémin. Lothar. Comb. 57:B57e, 2006) for semi-standard augmented fillings and if σ is the reverse of the identity, then our insertion algorithm reduces to the original Robinson–Schensted–Knuth row insertion algorithm. We use our generalized insertion algorithm to obtain new decompositions of the Schur functions into nonsymmetric elements called generalized Demazure atoms (which become Demazure atoms when σ is the identity). Other applications include Pieri rules for multiplying a generalized Demazure atom by a complete homogeneous symmetric function or an elementary symmetric function, a generalization of Knuth’s correspondence between matrices of non-negative integers and pairs of tableaux, and a version of evacuation for composition tableaux whose basement is an arbitrary permutation σ.     

Periodic solutions for systems of forced coupled pendulum-like equations

The existence of periodic solutions for systems of forced pendulum-like equations was studied in the papers by J. A. Marlin (Internat. J. Nonlinear Mech.3 (1968), 439–447) and J. Mawhin (Internat. J. Nonlinear Mech.5 (1970), 335–339). In both works some symmetry hypotheses on the forcing terms were considered. This paper discusses the existence and multiplicity of periodic solutions of systems under consideration without any requirement on the symmetry of the forcing terms. Note that as a model example it is possible to consider the motion of N coupled pendulums (see the already mentioned paper by J. A. Marlin) or the oscillations of an N-coupled point Josephson junction with external time-dependent disturbances studied in the autonomous case by M. Levi, F. C. Hoppensteadt, and W. L. Miranker (Quart. Appl. Math.36 (1978), 167–198).     

Induced partition properties of combinatorial cubes

An induced version of the partition theorem for parameter-sets of R. L. Graham and B. L. Rothschild (Trans. Amer. Math. Soc.159 (1971), 257–291) is proven. This theorem generalizes the Graham-Rothschild theorem in the same way as the partition theorem for finite hypergraphs (F. G. Abramson and L. A. Harrington, J. Symblic Logic43 (1978), 572–600 and J. Ne?et?il and V. Rödl; J. Combin. Theory Ser. A22 (1977), 289–312; 34 (1983), 183–201) generalizes Ramsey's theorem. Some applications are given, e.g., an induced version of the Rado-Folkman-Sanders theorem and an induced version of the partition theorem for finite Boolean lattices. Also it turns out that the partition theorem for finite hypergraphs is an easy consequence of the induced partition theorem for parameter-sets.     

On the number of rooted c-nets

W. T. Tutte (Canad. J. Math.15 (1963), 249–271) was the first person to find the number of rooted c-nets. Then, R. C. Mullin and P. J. Schellenberg found it again in another way (J. Combin. Theory4 (1968), 259–276). This note presents two simpler recursive formulae and an explicit one as a summation with all the terms positive except for at most one negative term.     

Scheduling precedence graphs of bounded height

The existence of a schedule for a partially ordered set of unit length tasks on m identical processors is known to be NP-complete (J. D. Ullman, NP-complete scheduling problems, J. Comput. System Sci., 10 (1975), 384–393). The problem remains NP-complete even if we restrict the precedence graph to be of height bounded by a constant. (J. K. Lenkstra and A. H. G. Rinnooy Kan, Complexity of scheduling under precedence constraints, Operations Res., 26 (1978), 22–35; D. Dolev and M. K. Warmuth, “Scheduling Flat Graphs,” IBM Research Report RJ 3398, 1982). In these NP-completeness proofs the upper bound on the number of available processors varies with the problem instance. We present a polynomial algorithm for the case where the upper bound on the number of available processors and the height of the precedence graph are both constants.     

Young-Fibonacci insertion, tableauhedron and Kostka numbers

This work is first concerned with some properties of the Young-Fibonacci insertion algorithm and its relation with Fomin's growth diagrams. It also investigates a relation between the combinatorics of Young-Fibonacci tableaux and the study of Okada's algebras associated to the Young-Fibonacci lattice. The original algorithm was introduced by Roby and we redefine it in such a way that both the insertion and recording tableaux of any permutation are conveniently interpreted as saturated chains in the Young-Fibonacci lattice. Using our conventions, we give a simpler proof of a property of Killpatrick's evacuation algorithm for Fibonacci tableaux. It also appears that this evacuation is no longer needed in making Roby's and Fomin's constructions coincide. We provide the set of Young-Fibonacci tableaux of size n with a structure of graded poset called tableauhedron, induced by the weak order of the symmetric group, and realized by transitive closure of elementary transformations on tableaux. We show that this poset gives a combinatorial interpretation of the coefficients of the transition matrix from the analogue of complete symmetric functions to analogue of the Schur functions in Okada's algebra associated to the Young-Fibonacci lattice. We prove a similar result relating usual Kostka numbers with four partial orders on Young tableaux, studied by Melnikov and Taskin.     

A finite crisscross method for oriented matroids

Our paper presents a new finite crisscross method for oriented matroids. Starting from a neither primal nor dual feasible tableau, we reach primal and dual optimal oriented circuits in a finite number of steps if they exist. If there is no optimal tableau then we show that there is no primal feasible circuit or there is no dual feasible cocircuit. So we give a new constructive proof for the general duality theorem (Bland J. Combin. Theory Ser. B 23 (1977), 33–57; Folkman and Lawrence J. Combin. Theory Ser. B 25 (1978), 199–236). Our pivot rule is a generalization of the “anticycling rule” suggested in Bland (op cit; Math. Oper. Res. 2 (1977), 103–107). Finite pivoting rules are given by Edmonds, Fukuda and Todd (Ph.D. dissertation, Univ. of Waterloo, 1982), SIAM Algebraic Discrete Math. 5, No. 4 (1984), 467–485). A general relaxed recursive algorithm was discovered independently by Jensen (Ph.D. thesis, School of OR and IE, Cornell, 1985) which is principally crisscross type. Jensen's is very general and flexible; in fact it can be considered as a family of algorithms. Among the conceivable algorithms in his general family our independently constructed crisscross method is characterized by its extreme simplicity.     

Résolution de problèmes hyperélastiques de recalage d'imagesResolution of some hyperelastic image-matching problems

We focus on some image-matching problems that are based on hyperelastic strain energies. We design an algorithm that solves numerically the Euler–Lagrange equations associated to the problem. This algorithm is formulated in terms of an ODE (Ordinary Differential Equation). We give a theorem which states that the ODE has a unique solution and converges to a solution of the Euler–Lagrange equations. To cite this article: F.J.P. Richard, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 295–299.     

An existence result for optimal economic growth problems

An existence result for optimal control problems of Lagrange type with unbounded time domain is derived very directly from a corresponding result for problems with bounded time domain. This subsumes the main existence result of R. F. Baum ¦J. Optim. Theory Appl.19 (1976), 89–116¦ and has the existence results for optimal economic growth problems of S.-I. Takekuma ¦J. Math. Econom.7 (1980), 193–208¦ and M. J. P. Magill ¦Econometrica49 (1981), 679–711; J. Math. Anal. Appl.82 (1981), 66–74¦ as simple corollaries. In addition, a new notion of uniform integrability is used, which coincides with the classical notion if the time domain is bounded.     

On Gronwall-Bellman-Bihari-type integral inequalities in several variables with retardation

Presented are some new nonlinear integral inequalities of the Gronwall-Bellman-Bihari type in n-independent variables with delay which extend recent results of C. C. Yeh and M.-H. Shin [J. Math. Anal. Appl.86, (1982), 157–167], C. C. Yeh [J. Math. Anal. Appl.87, (1982), 311–321], and A. I. Zahariev and D. D. Bainor [J. Math. Anal. Appl.89, (1981), 147–149]. Some applications of the results are included.     

Some remarks on permutation designs

A definition of isomorphism of two permutation designs is proposed, which differs from the definition in Bandt [J. Combinatorial Theory Ser. A21 (1976), 384–392]. The proposed definition has the (generally required) property that the allowed permutations always transform a permutation design into a permutation design. It is shown that the n permutation designs coming from the partitioning of S_n into permutation designs, as constructed in Bandt [J. Combinatorial Theory Ser. A21 (1976), 384–392] are all isomorphic. Further we find that this modified definition does not increase the number of nonisomorphic (6, 4) permutation designs. The same investigation showed that one of the designs, claimed to be a (6, 4) permutation design in [J. Combinatorial Theory Ser. A21 (1976), 384–392], is actually not a (6, 4) permutation design.     

An explicit bijection between semistandard tableaux and non-elliptic sl 3 webs

The sl ₃ spider is a diagrammatic category used to study the representation theory of the quantum group U _q (sl ₃). The morphisms in this category are generated by a basis of non-elliptic webs. Khovanov–Kuperberg observe that non-elliptic webs are indexed by semistandard Young tableaux. They establish this bijection via a recursive growth algorithm. Recently, Tymoczko gave a simple version of this bijection in the case that the tableaux are standard and used it to study rotation and join of webs. This article builds on Tymoczko’s bijection to give a simple and explicit algorithm for constructing all non-elliptic sl ₃ webs. As an application, we generalize results of Petersen–Pylyavskyy–Rhoades and Tymoczko proving that, for all non-elliptic sl ₃ webs, rotation corresponds to jeu de taquin promotion and join corresponds to shuffling.     

Random nonlinear Hammerstein equations

We prove existence theorems for random differential equations defined in a separable reflexive Banach space. These theorems are proved through the use of theory of random analysis established in [X. Z. Yuan, Random nonlinear mappings of monotone type, J. Math. Anal. Appl. 19] which differs from the other means, for example in [R. Kannan and H. Salehi, Random nonlinear equations and monotonic nonlinearities, J. Math. Anal. Appl. 57 (1977), 234–256; D. Kravvaritis, Existence theorems for nonlinear random equations and inequalities, J. Math. Anal. Appl. 86 (1982), 61–73; D. A. Kandilakis and N. S. Papageorgious, On the existence of solutions for random differential inclusions in a Banach space, J. Math. Anal. Appl. 126 (1987), 11–23].     

On Diagonal Equations over Finite Fields

In this paper, we obtain a sufficient condition for the diagonal equation to have only the trivial solution over finite fields. This result improves a theorem of Sun (J. Sichuan Normal Univ. Nat. Sci. Ed.26 (1989), 55–59) greatly and proves that the conjecture posed by Powell (J. Number Theory18 (1984), 34–40) holds for general n∈N as well.     

L-fuzzy normal spaces and Tietze extension theorem

In this paper we prove a characterization theorem for normal L-fuzzy topological spaces (L is an infinitely distributive lattice with an order-reversing involution). In the particular case L = {0, 1} this theorem reduces to a known result of Katětov (Fund. Math. 38 (1951), 85–91) and Tong (Duke Math. J. 19 (1952), 289–292). As an important application we obtain a fuzzy version of Tietze extension theorem. This yields an affirmative answer to a question raised in a series of papers by Rodabaugh (Fuzzy Sets and Systems 11 (1983), 163–183).     

Existence results without convexity conditions for general problems of optimal control with singular components

This note presents a new, quick approach to existence results without convexity conditions for optimal control problems with singular components in the sense of E. J. McShane (SIAM J. Control5 (1967), 438–485). Starting from the resolvent kernel representation of the solutions of a linear integral equation, a version of Fatou's lemma in several dimensions is shown to lead directly to a compactness result for the attainable set and an existence result for a Mayer problem. These results subsume those of L. W. Neustadt (J. Math. Anal. Appl.7 (1963), 110–117), C. Olech (J. Differential Equations2 (1966), 74–101), M. Q. Jacobs (“Mathematical Theory of Control,” pp. 46–53, Academic Press, 1967), L. Cesari (SIAM J. Control12 (1974), 319–331) and T. S. Angell (J. Optim. Theory Appl.19 (1976), 63–79).