Dense 3-uniform hypergraphs containing a large clique

An r-uniform graph C is dense if and only if every proper subgraph G' of G satisfies λ(G') λ(G).,where λ(G) is the Lagrangian of a hypergraph G. In 1980's, Sidorenko showed that π(F), the Turán density of an γ-uniform hypergraph F is r! multiplying the supremum of the Lagrangians of all dense F-hom-free γ-uniform hypergraphs. This connection has been applied in the estimating Turán density of hypergraphs. When γ=2 the result of Motzkin and Straus shows that a graph is dense if and only if it is a complete graph. However,when r ≥ 3, it becomes much harder to estimate the Lagrangians of γ-uniform hypergraphs and to characterize the structure of all dense γ-uniform graphs. The main goal of this note is to give some sufficient conditions for3-uniform graphs with given substructures to be dense. For example, if G is a 3-graph with vertex set [t] and m edges containing [t-1]~(3),then G is dense if and only if m≥{t-2 3)+(t-2 2)+1. We also give a sufficient condition on the number of edges for a 3-uniform hypergraph containing a large clique minus 1 or 2 edges to be dense.     

On Graph-Lagrangians and clique numbers of 3-uniform hypergraphs

The paper explores the connection of Graph-Lagrangians and its maximum cliques for 3-uniform hypergraphs.Motzkin and Straus showed that the Graph-Lagrangian of a graph is the Graph-Lagrangian of its maximum cliques.This connection provided a new proof of Turán classical result on the Turán density of complete graphs.Since then,Graph-Lagrangian has become a useful tool in extremal problems for hypergraphs.Peng and Zhao attempted to explore the relationship between the Graph-Lagrangian of a hypergraph and the order of its maximum cliques for hypergraphs when the number of edges is in certain range.They showed that if G is a 3-uniform graph with m edges containing a clique of order t-1,then λ(G)=λ([t-1]~((3))) provided (t-13)≤m≤(t-13)+_(t-22).They also conjectured:If G is an r-uniform graph with m edges not containing a clique of order t-1,then λ(G)λ([t-1]~((r))) provided (t-1r)≤ m ≤(t-1r)+(t-2r-1).It has been shown that to verify this conjecture for 3-uniform graphs,it is sufficient to verify the conjecture for left-compressed 3-uniform graphs with m=t-13+t-22.Regarding this conjecture,we show: If G is a left-compressed 3-uniform graph on the vertex set [t] with m edges and |[t-1]~((3))\E(G)|=p,then λ(G)λ([t-1]~((3))) provided m=(t-13)+(t-22) and t≥17p/2+11.     

More constructions of APN and differentially 4-uniform functions by concatenation

We study further the method of concatenating the outputs of two functions for designing an APN or a differentially 4-uniform (n, n)-function for every even n. We deduce several specific constructions of APN or differentially 4-uniform (n, n)-functions from APN and differentially 4-uniform (n/2, n/2)-functions. We also give a construction of quadratic APN functions which includes as particular cases a previous construction by the author and a more recent construction by Pott and Zhou.     

Enumeration of Maximum Acyclic Hypergraphs

Abstract Acyclic hypergraphs are analogues of forests in graphs.They are very useful in the design ofdatabases. In this article,the maximum size of an acvclic hypergraph is determined and the number of maximumγ-uniform acyclic hypergraphs of order n is shown to be (_(r-1)~n)(n(r-1)-r~2 2r)~(n-r-1).     

HAMILTONIAN DECOMPOSITION OF COMPLETE BIPARTITE γ-HYPERGRAPHS

1. IntroductionHypergraphs are most general structure in discrete mathematics. Computer scientistsintroduced the concept of acyclic hypergraphs and proved that acyc1ic hypergraphs are veryuseful in database theory['--']. In [l], a new system of axioms fOr paths, connectivity andcycles of hypergraphs was introduced. In this paper, we wiIl introduce the concepts ofbipartite hypergraphs and Hamiltonian paths and cycles of a hypergraph.Let V be a finite set. n = (V e) is called a hypergraph on …     

A Rao-type characterization for a sequence to have a realization containing an arbitrary subgraph H

Let G be an arbitrary spanning subgraph of the complete graph Kr+1 on r+1 vertices and Kr+1-E(G) be the graph obtained from Kr+1 by deleting all edges of G.A non-increasing sequence π=(d1,d2,...,dn) of nonnegative integers is said to be potentially Kr+1-E(G)-graphic if there is a graph on n vertices that has π as its degree sequence and contains Kr+1-E(G) as a subgraph.In this paper,a characterization of π that is potentially Kr+1-E(G)-graphic is given,which is analogous to the Erdo s–Gallai characterization of graphic sequences using a system of inequalities.This is a solution to an open problem due to Lai and Hu.As a corollary,a characterization of π that is potentially Ks,tgraphic can also be obtained,where Ks,t is the complete bipartite graph with partite sets of size s and t.This is a solution to an open problem due to Li and Yin.     

Analysis of search-extension method for finding multiple solutions of nonlinear problem

For numerical computations of multiple solutions of the nonlinear elliptic problemΔu f(u)=0 inΩ, u=0 onΓ, a search-extension method (SEM) was proposed and systematically studied by the authors. This paper shall complete its theoretical analysis. It is assumed that the nonlinearity is non-convex and its solution is isolated, under some conditions the corresponding linearized problem has a unique solution. By use of the compactness of the solution family and the contradiction argument, in general conditions, the high order regularity of the solution u∈H~(1 α),α>0 is proved. Assume that some initial value searched by suitably many eigenbases is already fallen into the neighborhood of the isolated solution, then the optimal error estimates of its nonlinear finite element approximation are shown by the duality argument and continuation method.     

The Assodated Matrices of Ap, n, 4p-5 Polyhedra and their Admissible Onerations

In this paper we describe the decomposition problem of a special kind of Ap. n. 4p-5 polyhedra by using the associated matrices and their admissible operations.     

MANIFOLD METHOD FOR BOUNDARY VALUE PROBLEM OF TWO ORDER DIFFERENTIAL EQUATIONS

The multiplicity and bifurcation of a two-point boundary value problem(BVP) of nonlinear differential equations(NLDE) are studied firstly using a manifold method.And by some convenient numerical approaches,the discussion on the solutions to the BVP of two order NLDE is turned into the problem on the intersections of the end manifold with the target manifold defined by the boundary conditions,also the bifurcation diagrams and the numerical solutions to the NLDE are obtained.As an example,a mathematical model describing the deformations of elastic circular bar used as gripper and spring element is discussed.     

On the infimum problem of Hilbert space effects

The quantum effects for a physical system can be described by the set ε(H) of positive operators on a complex Hilbert space H that are bounded above by the identity operator I. The infimum problem of Hilbert space effects is to find under what condition the infimum A∧B exists for two quantum effects A and B∈ε(H). The problem has been studied in different contexts by R. Kadison, S. Gudder, M. Moreland, and T. Ando. In this note, using the method of the spectral theory of operators, we give a complete answer of the infimum problem. The characterizations of the existence of infimum A∧B for two effects A. B∈ε(H) are established.     

Asymptotics of Laurent Polynomials of Odd Degree Orthogonal with Respect to Varying Exponential Weights

Let denote the linear space over spanned by . Define the (real) inner product , where V satisfies: (i) V is real analytic on ; (ii) ; and (iii) . Orthogonalisation of the (ordered) base with respect to yields the even degree and odd degree orthonormal Laurent polynomials , and . Define the even degree and odd degree monic orthogonal Laurent polynomials: and . Asymptotics in the double-scaling limit such that of (in the entire complex plane), , and (in the entire complex plane) are obtained by formulating the odd degree monic orthogonal Laurent polynomial problem as a matrix Riemann-Hilbert problem on , and then extracting the large-n behaviour by applying the non-linear steepest-descent method introduced in [1] and further developed in [2],[3].     

A QR-type reduction for computing the SVD of a general matrix product/quotient

In this paper, a QR-type reduction technique is developed for the computation of the SVD of a general matrix product/quotient with or . First the matrix A is reduced by at most m QR-factorizations to the form , where and . Then the SVD of A is obtained by computing the CSD (Cosine-Sine Decomposition) of and using the Matlab command gsvd. The performance of the proposed method is verified by some numerical examples. Mathematics Subject Classification (1991):65F15, 65H15This work is supported by grants from several funding agencies: 1. Research Council KUL: Concerted Research Action GOA-Mefisto 666 (Mathematical Engineering) 2. Flemish Government: FWO (Fund for Scientific Research - Flanders) projects G292.95 and G256.97, FWO Research Communities ICCoS and ANMMM, 3. Belgian Federal Government: DWTC (IUAP IV-02 and IUAP V-10-29).Part of this research was carried out while D. Chu was a visiting researcher at the K.U.Leuven. L. De Lathauwer holds a permanent research position with the French CNRS; he also holds a honorary post-doctoral research mandate with the FWO. B. De Moor is a full professor at the K.U.Leuven. The scientific responsibility is assumed by the authors     

基于有限辛空间的一致偏序集和Leonard对

设F_q为q个元素的有限域,q是一个素数的幂.令F_q~((2v))是F_q上的2v维辛空间,M(m,s;2v)表示辛群作用在F_q~((2v))上的子空间的轨道.L(m,s;2v)是M(m,s;2v)的子空间生成的集合.若按照子空间的包含关系来规定L(m,s;2v)的序,则得一偏序集,记为L_O(m,s;2v).本文,首先构造了L(m,s;2v)上的子偏序集L_O(m,s;2v),然后证明这个子偏序集是强一致偏序的.最后利用这个偏序集构造了Leonard对.     

Solvability of a higher-order multi-point boundary value problem at resonance

Based on the coincidence degree theory of Mawhin, we get a new general existence result for the following higher-order multi-point boundary value problem at resonance

Lower Bounds for the Perron Root of a Sum of Nonnegative Matrices

Let $A^{(l)} (l = 1, \ldots ,k)$ be $n \times n$ nonnegative matrices with right and left Perron vectors $u^{(l)} $ and $v^{(l)} $ , respectively, and let $D^{(l)} $ and $E^{(l)} (l = 1, \ldots ,k)$ be positive-definite diagonal matrices of the same order. Extending known results, under the assumption that $$u^{(1)} \circ v^{(1)} = \ldots = u^{(k)} \circ v^{(k)} \ne 0$$ (where `` $ \circ $ '' denotes the componentwise, i.e., the Hadamard product of vectors) but without requiring that the matrices $A^{(l)} $ be irreducible, for the Perron root of the sum $\sum\nolimits_{l = 1}^k {D^{(l)} A^{(l)} E^{(l)} } $ we derive a lower bound of the form $$\rho \left( {\sum\limits_{l = 1}^k {D^{(l)} A^{(l)} E^{(l)} } } \right) \geqslant \sum\limits_{l = 1}^k {\beta _{l\rho } (A^{(l)} ),{\text{ }}\beta _l >0.} $$ Also we prove that, for arbitrary irreducible nonnegative matrices $A^{{\text{ (}}l{\text{)}}} (l = 1, \ldots ,k),$ , $$\rho \left( {\sum\limits_{l = 1}^k {A^{(l)} } } \right) \geqslant \sum\limits_{l = 1}^k {\alpha _{l\rho } (A^{(l)} ),} $$ where the coefficients ∝₁>0 are specified using an arbitrarily chosen normalized positive vector. The cases of equality in both estimates are analyzed, and some other related results are established. Bibliography: 8 titles.     

Uniqueness of the embedding continuous convolution semigroup of a Gaussian probability measure on the affine group and an application in mathematical finance

Let $\{\mu _{t}^{(i)}\}_{t\ge 0}$ ( $i=1,2$ ) be continuous convolution semigroups (c.c.s.) of probability measures on $\mathbf{Aff(1)}$ (the affine group on the real line). Suppose that $\mu _{1}^{(1)}=\mu _{1}^{(2)}$ . Assume furthermore that $\{\mu _{t}^{(1)}\}_{t\ge 0}$ is a Gaussian c.c.s. (in the sense that its generating distribution is a sum of a primitive distribution and a second-order differential operator). Then $\mu _{t}^{(1)}=\mu _{t}^{(2)}$ for all $t\ge 0$ . We end up with a possible application in mathematical finance.     

On the structure of Noetherian symbolic rees algebras

Let A be a Noetherian local ring and I an ideal of A. In this paper we use a slightly generalized notion of a symbolic power I⁽ⁿ⁾ of I and considerR = . First we characterize the property of R to be Noetherian by an equimultiplicity condition of some symbolic power I^(k). The main purpose of this note is to explore the problem whenR,R′ = and are Cohen-Macaulay or Gorenstein algebras in the case that A is a normal domain and ht I=1. Partially supported by the Max-Planck-Institute of Mathematics Bonn. Supported by a grant of the Heinrich Hertz-Stiftung. Supported by a grant of the Alexander von Humboldt-Stiftung.     

三角Banach代数的Lie弱顺从性

设$\mathcal {A,\ B}$ 是含单位元的Banach代数, $\mathcal M$ 是一个Banach $\mathcal {A,\ B}$-双模. $\mathcal {T}=\left ( \begin{array}{cc} \mathcal {A} & \mathcal M \\ & \mathcal {B} \\ \end{array} \right )$按照通常矩阵加法和乘法,范数定义为$\|\left( \begin{array}{cc} a & m \\ & b\\ \end{array} \right)\|=\|a\|_{\mathcal A}+\|m\|_{\mathcal M}+\|b\|_{\mathcal B}$,构成三角Banach 代数.如果从$\mathcal T$到其$n$次对偶空间$\mathcal T^{n}$上的Lie导子都是标准的,则称$\mathcal T$是Lie $n$弱顺从的.本文研究了三角Banach代数$\mathcal T$上的Lie $n$弱顺从性,证明了有限维套代数是Lie $n$弱顺从的.     

Higher Level Affine Crystals and Young Walls

Using combinatorics of Young walls, we give a new realization of arbitrary level irreducible highest weight crystals for quantum affine algebras of type , , , , , and . The irreducible highest weight crystals are realized as the affine crystals consisting of reduced proper Young walls. The notion of slices and splitting of blocks plays a crucial role in the construction of crystals.Presented by Peter Littelman.