The structure of near polygons with quads

We develop a structure theory for near polygons with quads. Main results are the existence of sub 2j-gons for 2?j?d and the nonexistence of regular sporadic 2d-gons for d?4 with s>1 and t ₂>1 and t ₃≠t ₂(t ₂+1).     

A Higman inequality for regular near polygons

The inequality of Higman for generalized quadrangles of order (s,t) with s>1 states that t≤s ². We generalize this by proving that the intersection number c _i of a regular near 2d-gon of order (s,t) with s>1 satisfies the tight bound c _i ≤(s ²ⁱ −1)/(s ²−1), and we give properties in case of equality. It is known that hemisystems in generalized quadrangles meeting the Higman bound induce strongly regular subgraphs. We also generalize this by proving that a similar subset in regular near 2d-gons meeting the bounds would induce a distance-regular graph with classical parameters (d,b,α,β)=(d,−q,−(q+1)/2,−((−q) ^d +1)/2) with q an odd prime power.     

The completion of the classification of the regular near octagons with thick quads

Brouwer and Wilbrink [3] showed the nonexistence of regular near octagons whose parameters s, t₂, t₃ and t satisfy s ≥ 2, t₂ ≥ 2 and t₃ ≠ t₂(t₂+1). Later an arithmetical error was discovered in the proof. Because of this error, the existence problem was still open for the near octagons corresponding with certain values of s, t₂ and t₃. In the present paper, we will also show the nonexistence of these remaining regular near octagons. MSC2000 05B25, 05E30, 51E12 Postdoctoral Fellow of the Research Foundation - Flanders     

Dense Subsets of H1/2(S2, S1)

We prove that the maps from S ² intoS ¹ having a finite number of isolated singularities ofdegree ±1 are dense for the strong topology inH ^1/2(S ², S ¹). We also prove that smooth maps are densein H ^1/2(S ², S ¹)for the sequentially weak topology andthat this is no more the case in H ^s (S ², S ¹) for s> 1/2.     

Constrained Ramsey numbers of graphs

Given two graphs G and H, let f(G,H) denote the minimum integer n such that in every coloring of the edges of K_n, there is either a copy of G with all edges having the same color or a copy of H with all edges having different colors. We show that f(G,H) is finite iff G is a star or H is acyclic. If S and T are trees with s and t edges, respectively, we show that 1+s(t?2)/2≤f(S,T)≤(s?1)(t²+3t). Using constructions from design theory, we establish the exact values, lying near (s?1)(t?1), for f(S,T) when S and T are certain paths or star‐like trees. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 1–16, 2003     

A Note on Regular Near Polygons

Let be a regular near polygon of order (s,t) with s>1 and t3. Let d be the diameter of , and let r:= max{i(c_i,a_i,b_i)=(c₁,a₁,b₁)}. In this note we prove several inequalities for . In particular, we show that s is bounded from above by function in t if We also consider regular near polygons of order (s,3).This work was partly supported by the Grant-in-Aid for Scientific Research (No 14740072), the Ministry of Education, Culture, Sports, Science and Technology, JapanThis work was partly done when the author was at the Com²MaC center at the Pohang University of Science and Technology. He would like to thank the Com²MaC-KOSEF for its support     

On the h-triangles of sequentially (S r ) simplicial complexes via algebraic shifting

Recently, Haghighi, Terai, Yassemi, and Zaare-Nahandi introduced the notion of a sequentially (S _r ) simplicial complex. This notion gives a generalization of two properties for simplicial complexes: being sequentially Cohen–Macaulay and satisfying Serre’s condition (S _r ). Let Δ be a (d?1)-dimensional simplicial complex with Γ(Δ) as its algebraic shifting. Also let (h _i,j (Δ))_{0≤j≤i≤d} be the h-triangle of Δ and (h _i,j (Γ(Δ)))_{0≤j≤i≤d} be the h-triangle of Γ(Δ). In this paper, it is shown that for a Δ being sequentially (S _r ) and for every i and j with 0≤j≤i≤r?1, the equality h _i,j (Δ)=h _i,j (Γ(Δ)) holds true.     

Sharp bounds for the number of 3‐independent partitions and the chromaticity of bipartite graphs

Given a graph G and an integer k ≥ 1, let α(G, k) denote the number of k‐independent partitions of G. Let ??^?s(p,q) (resp., ??₂^?s(p,q)) denote the family of connected (resp., 2‐connected) graphs which are obtained from the complete bipartite graph K_p,q by deleting a set of s edges, where p ≥ q ≥ 2. This paper first gives a sharp upper bound for α(G,3), where G ∈ ?? ^?s(p,q) and 0 ≤ s ≤ (p ? 1)(q ? 1) (resp., G ∈ ?? ₂^?s(p,q) and 0 ≤ s ≤ p + q ? 4). These bounds are then used to show that if G ∈ ?? ^?s(p,q) (resp., G ∈ ?? ₂^?s (p,q)), then the chromatic equivalence class of G is a subset of the union of the sets ??^?s_i(p+i,q?i) where max and s_i = s ? i(p?q+i) (resp., a subset of ??₂^?s(p,q), where either 0 ≤ s ≤ q ? 1, or s ≤ 2q ? 3 and p ≥ q + 4). By applying these results, we show finally that any 2‐connected graph obtained from K_p,q by deleting a set of edges that forms a matching of size at most q ? 1 or that induces a star is chromatically unique. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 48–77, 2001     

On some d-dimensional dual hyperovals in

Let d≥3. Let H be a d+1-dimensional vector space over GF(2) and {e₀,…,e_d} be a specified basis of H. We define Supp(t){e_t1,…,e_tl}, a subset of a specified base for a non-zero vector t=e_t1++e_tl of H, and Supp(0)0/. We also define J(t)Supp(t) if |Supp(t)| is odd, and J(t)Supp(t){0} if |Supp(t)| is even.For s,tH, let {a(s,t)} be elements of H(HH) which satisfy the following conditions: (1) a(s,s)=(0,0), (2) a(s,t)=a(t,s), (3) a(s,t)≠(0,0) if s≠t, (4) a(s,t)=a(s^′,t^′) if and only if {s,t}={s^′,t^′}, (5) {a(s,t)|tH} is a vector space over GF(2), (6) {a(s,t)|s,tH} generate H(HH). Then, it is known that S{X(s)|sH}, where X(s){a(s,t)|tH{s}}, is a dual hyperoval in PG(d(d+3)/2,2)=(H(HH)){(0,0)}.In this note, we assume that, for s,tH, there exists some x_s,t in GF(2) such that a(s,t) satisfies the following equation: Then, we prove that the dual hyperoval constructed by {a(s,t)} is isomorphic to either the Huybrechts’ dual hyperoval, or the Buratti and Del Fra’s dual hyperoval.     

Forbidden induced subgraph characterization of cograph contractions

Let S₁, S₂,…,S_t be pairwise disjoint non‐empty stable sets in a graph H. The graph H^* is obtained from H by: (i) replacing each S_i by a new vertex q_i; (ii) joining each q_i and q_j, 1 ≤ i # j ≤ t, and; (iii) joining q_i to all vertices in H – (S₁ ∪ S₂ ∪ ··· ∪ S_t) which were adjacent to some vertex of S_i. A cograph is a P₄‐free graph. A graph G is called a cograph contraction if there exist a cograph H and pairwise disjoint non‐empty stable sets in H for which G ? H^*. Solving a problem proposed by Le [ 2 ], we give a finite forbidden induced subgraph characterization of cograph contractions. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 217–226, 2004     

The irredundant ramsey number s(3,3,3) = 13

Let G₁, G₂,. …, G_t be an arbitrary t-edge coloring of K_n, where for each i ∈ {1,2, …, t}, G_i is the spanning subgraph of K_n consisting of all edges colored with the ith color. The irredundant Ramsey number s(q₁, q₂, …, q_t) is defined as the smallest integer n such that for any t-edge coloring of K_n, _i has an irredundant set of size q_i for at least one i ∈ {1,2, …,t}. It is proved that s(3,3,3) = 13, a result that improves the known bounds 12 ≤ s(3,3,3) ≤ 14.     

The dimension of the determinantal scheme vs (t,t,2) of the catalecticant matrix

Let T be a Gorenstein sequence of a graded artinian Gorenstein ring k[x ₀,x ₁,x ₂]/I We develop a dimension formula for PGor(T) in terms of the alignment character. Based on our formula, we find a very large component of V_s (t,t,2) when s=r_t-1+1 and t is large enough. This answers Diesel’s conjecture negatively. Further we show that V_s (t,t,2) is irreducible of dimension 3s-1 for s ≤t+1,t ≥ 2 and dim V_s (t,t,2)= 3s-1 for small s. Finally an algorithm to calculate dim V_s (t,t,2) is constructed, and we find the values of dim V_s (t,t,2) for t ≤ 16.     

Hamiltonian ODEs in the Wasserstein space of probability measures

In this paper we consider a Hamiltonian H on ??₂(?^2d), the set of probability measures with finite quadratic moments on the phase space ?^2d = ?^d × ?^d, which is a metric space when endowed with the Wasserstein distance W₂. We study the initial value problem dμ_t/dt + ? · (??_d v _tμ_t) = 0, where ??_d is the canonical symplectic matrix, μ₀ is prescribed, and v _t is a tangent vector to ??₂(?^2d) at μ_t, belonging to ?H(μ_t), the subdifferential of H at μ_t. Two methods for constructing solutions of the evolutive system are provided. The first one concerns only the case where μ₀ is absolutely continuous. It ensures that μ_t remains absolutely continuous and v _t = ?H(μ_t) is the element of minimal norm in ?H(μ_t). The second method handles any initial measure μ₀. If we further assume that H is λ‐convex, proper, and lower‐semicontinuous on ??₂(?^2d), we prove that the Hamiltonian is preserved along any solution of our evolutive system, H(μ_t) = H(μ₀). © 2007 Wiley Periodicals, Inc.     

Proportional graphs

Let S be a finite set of graphs and t a real number, 0 < t < 1. A (deterministic) graph G is (t, 5)-proportional if for every H ∈ S, the number of induced subgraphs of G isomorphic to H equals the expected number of induced copies of H in the random graph G_{n, t} where n = |V(G)|. Let S_k = {all graphs on k vertices}, in particular S₃ = {K₃, P₂, K₂K_t, D₃}. The notion of proportional graphs stems from the study of random graphs (Barbour, Karoński, and Ruciński, J Combinat. Th. Ser. B, 47 , 125-145, 1989; Janson and Nowicki, Prob. Th. Rel. Fields, to appear, Janson, Random Struct. Alg., 1 , 15-37, 1990) where it is shown that (t, S₃)-proportional graphs play a very special role; we thus call them simply t-proportional. However, only a few ½-proportional graphs on 8 vertices were known and it was an open problem whether there are any f-proportional graphs with t ≠ ½ at all. In this paper, we show that there are infinitely many ½-proportional graphs and that there are t-proportional graphs with t≠. Both results are proved constructively. [We are not able to provide the latter construction for all f∈ Q∩(0,1), but the set of ts for which our construction works is dense in (0,1).] To support a conviction that the existence of (t, S₃)-proportional graphs was not quite obvious, we show that there are no (t, S₄)-proportional graphs.     

New Logarithmic Sobolev Inequalities and an ɛ‐Regularity Theorem for the Ricci Flow

In this note, we prove an ?‐regularity theorem for the Ricci flow. Let (Mⁿ,g(t)) with t ? [?T,0] be a Ricci flow, and let H_x0(y,s) be the conjugate heat kernel centered at some point (x₀,0) in the final time slice. By substituting H_x0(?,s) into Perelman's W‐functional, we obtain a monotone quantity W_x0(s) that we refer to as the pointed entropy. This satisfies W_x0(s) ≤ 0, and W_x0(s) = 0 if and only if (Mⁿ,g(t)) is isometric to the trivial flow on Rⁿ. Then our main theorem asserts the following: There exists ? > 0, depending only on T and on lower scalar curvature and μ‐entropy bounds for the initial slice (Mⁿ,g(?T)) such that W_x0(s) ≥ ?? implies |Rm| ≤ r^?2 on P_{? r}(x₀,0), where r² ≡ |s| and P_ρ(x,t) ≡ B_ρ(x,t) × (t?ρ²,t] is our notation for parabolic balls. The main technical challenge of the theorem is to prove an effective Lipschitz bound in x for the s‐average of W_x(s). To accomplish this, we require a new log‐Sobolev inequality. Perelman's work implies that the metric measure spaces (Mⁿ,g(t),dvol_g(t)) satisfy a log‐Sobolev; we show that this is also true for the heat kernel weighted spaces (Mⁿ,g(t),H_x0(?,t)dvol_g(t)). Our log‐Sobolev constants for these weighted spaces are in fact universal and sharp. The weighted log‐Sobolev has other consequences as well, including certain average Gaussian upper bounds on the conjugate heat kernel. © 2014 Wiley Periodicals, Inc.     

Mixed block designs

Let V_i (i = 1, 2) be a set of size v_i. Let D be a collection of ordered pairs (b₁, b₂) where b_i is a k_i-element subset of V_i. We say that D is a mixed t-design if there exist constants λ _(j,j2), (0 ≤ j_i ≤ k_i, j₁ + j₂ ≤ t) such that, for every choice of a j₁-element subset S₁ of V₁ and every choice of a j₂-element subset S₂ of V₂, there exist exactly λ_(j1,j2) ordered pairs (b₁, b₂) in D satisfying S₁ ⊆ b₁ and S₂ ⊆ b₂. In W. J. Martin [Designs in product association schemes, submitted for publication], Delsarte's theory of designs in association schemes is extended to products of Q-polynomial association schemes. Mixed t-designs arise as a particularly interesting case. These include symmetric designs with a distinguished block and α-resolvable balanced incomplete block designs as examples. The theory in the above-mentioned paper yields results on mixed t-designs analogous to those known for ordinary t-designs, such as the Ray-Chaudhuri/Wilson bound. For example, the analogue of Fisher's inequality gives |D| ≥ v₁ + v₂ − 1 for mixed 2-designs with Bose's condition on resolvable designs as a special case. Partial results are obtained toward a classification of those mixed 2-designs D with |D| = v₁ + v₂ − 1. The central result of this article is Theorem 3.1, an analogue of the Assmus–Mattson theorem which allows us to construct mixed (t + 1 − s)-designs from any t-design with s distinct block intersection numbers. © 1998 John Wiley & Sons, Inc. J Combin Designs 6:151–163, 1998     

Analysis of two commodity Markovian inventory system with lead time

A two commodity continuous review inventory system with independent Poisson processes for the demands is considered in this paper. The maximum inventory level for the i-th commodity is fixed asS ⁱ (i = 1,2). The net inventory level at timet for the i-th commodity is denoted byI ⁱ(t),i = 1,2. If the total net inventory levelI(t) =I ¹(t) +I ²(t) drops to a prefixed level s[ \leqslant \tfrac(S₁ - 2)2or\tfrac(S₂ - 2)2]s[ \leqslant \tfrac{{(S_1 - 2)}}{2}or\tfrac{{(S_2 - 2)}}{2}] , an order will be placed for (S ⁱ −s) units of i-th commodity(i=1,2). The probability distribution for inventory level and mean reorders and shortage rates in the steady state are computed. Numerical illustrations of the results are also provided.     

Automorphisms of free groups and the mapping class groups of closed compact orientable surfaces

Let N be the stabilizer of the word w = s ₁ t ₁ s ₁ ^?1 t ₁ ^?1 … s _g t _g s _g ^?1 t _g ^?1 in the group of automorphisms Aut(F _2g ) of the free group with generators ?ub;s _i, t _i?ub; _i=1,…,g . The fundamental group π₁(Σ_g) of a two-dimensional compact orientable closed surface of genus g in generators ?ub;s _i, t _i?ub; is determined by the relation w = 1. In the present paper, we find elements S _i, T _i ∈ N determining the conjugation by the generators s _i, t _i in Aut(π₁(Σ_g)). Along with an element β ∈ N, realizing the conjugation by w, they generate the kernel of the natural epimorphism of the group N on the mapping class group M _g,0 = Aut(π₁(Σ_g))/Inn(π₁(Σ_g)). We find the system of defining relations for this kernel in the generators S ₁, …, S _g, T ₁, …, T _g, α. In addition, we have found a subgroup in N isomorphic to the braid group B _g on g strings, which, under the abelianizing of the free group F _2g , is mapped onto the subgroup of the Weyl group for Sp(2g, ?) consisting of matrices that contain only 0 and 1.     

Constant-Sign Solutions of a System of Fredholm Integral Equations

We consider the following system of Fredholm intergral equations u _i (t)=₀ ¹ g _i (t,s)f _i (s,u ₁(s),u ₂(s),...,u _n (s)) ds, t[0,1], 1in. Criteria are offered for the existence of single, double and multiple solutions of the system that are of constant signs. The generality of the results obtained is illustrated through applications to several well known boundary value problems. We also extend the above system of Fredholm intergral equations to that on the half-line [0,) u _i (t)=₀ g _i (t,s)f _i (s,u ₁(s),u ₂(s),...,u _n (s)) ds, t[0,), 1in and investigate the existence of constant-sign solutions.     

On the growth of generating sets for direct powers of semigroups

For a semigroup S its d-sequence is d(S)=(d ₁,d ₂,d ₃,…), where d _i is the smallest number of elements needed to generate the ith direct power of S. In this paper we present a number of facts concerning the type of growth d(S) can have when S is an infinite semigroup, comparing them with the corresponding known facts for infinite groups, and also for finite groups and semigroups.