Cohen-macaulay bipartite graphs

Let G be a graph on the vertex set V={x ₁, ..., x _n}. Let k be a field and let R be the polynomial ring k[x ₁, ..., x _n]. The graph ideal I(G), associated to G, is the ideal of R generated by the set of square-free monomials x _ix_j so that x _i, is adjacent to x _j. The graph G is Cohen-Macaulay over k if R/I(G) is a Cohen-Macaulay ring. Let G be a Cohen-Macaulay bipartite graph. The main result of this paper shows that G{v} is Cohen-Macaulay for some vertex v in G. Then as a consequence it is shown that the Reisner-Stanley simplicial complex of I(G) is shellable. An example of N. Terai is presented showing these results fail for Cohen-Macaulay non bipartite graphs. Partially supported by COFAA-IPN, CONACyT and SNI, México.     

Linked graphs with restricted lengths

A graph G is k-linked if G has at least 2k vertices, and for every sequence x₁,x₂,…,x_k,y₁,y₂,…,y_k of distinct vertices, G contains k vertex-disjoint paths P₁,P₂,…,P_k such that P_i joins x_i and y_i for i=1,2,…,k. Moreover, the above defined k-linked graph G is modulo (m₁,m₂,…,m_k)-linked if, in addition, for any k-tuple (d₁,d₂,…,d_k) of natural numbers, the paths P₁,P₂,…,P_k can be chosen such that P_i has length d_i modulo m_i for i=1,2,…,k. Thomassen showed that, for each k-tuple (m₁,m₂,…,m_k) of odd positive integers, there exists a natural number f(m₁,m₂,…,m_k) such that every f(m₁,m₂,…,m_k)-connected graph is modulo (m₁,m₂,…,m_k)-linked. For m₁=m₂=…=m_k=2, he showed in another article that there exists a natural number g(2,k) such that every g(2,k)-connected graph G is modulo (2,2,…,2)-linked or there is XV(G) such that |X|4k−3 and G−X is a bipartite graph, where (2,2,…,2) is a k-tuple.We showed that f(m₁,m₂,…,m_k)max{14(m₁+m₂++m_k)−4k,6(m₁+m₂++m_k)−4k+36} for every k-tuple of odd positive integers. We then extend the result to allow some m_i be even integers. Let (m₁,m₂,…,m_k) be a k-tuple of natural numbers and ℓk such that m_i is odd for each i with ℓ+1ik. If G is 45(m₁+m₂++m_k)-connected, then either G has a vertex set X of order at most 2k+2ℓ−3+δ(m₁,…,m_ℓ) such that G−X is bipartite or G is modulo (2m₁,…,2m_ℓ,m_ℓ+1,…,m_k)-linked, where

Our results generalize several known results on parity-linked graphs.     

Betti numbers of determinantal ideals

Let R=k[x₁,…,x_n] be a polynomial ring and let IR be a graded ideal. In [T. Römer, Betti numbers and shifts in minimal graded free resolutions, arXiv: AC/070119], Römer asked whether under the Cohen–Macaulay assumption the ith Betti number β_i(R/I) can be bounded above by a function of the maximal shifts in the minimal graded free R-resolution of R/I as well as bounded below by a function of the minimal shifts. The goal of this paper is to establish such bounds for graded Cohen–Macaulay algebras k[x₁,…,x_n]/I when I is a standard determinantal ideal of arbitrary codimension. We also discuss other examples as well as when these bounds are sharp.     

Quadratic algebras of skew type and the underlying monoids

We consider algebras over a field K defined by a presentation Kx₁,…,x_nR, where R consists of square-free relations of the form x_ix_j=x_kx_l with every monomial x_ix_j, i≠j, appearing in one of the relations. Certain sufficient conditions for the algebra to be noetherian and PI are determined. For this, we prove more generally that right noetherian algebras of finite Gelfand–Kirillov dimension defined by homogeneous semigroup relations satisfy a polynomial identity. The structure of the underlying monoid, defined by the same presentation, is described. This is used to derive information on the prime radical and minimal prime ideals. Some examples are described in detail. Earlier, Gateva-Ivanova and van den Bergh, and Jespers and Okni ski considered special classes of such algebras in the contexts of noetherian algebras, Gröbner bases, finitely generated solvable groups, semigroup algebras, and set theoretic solutions of the Yang–Baxter equation.     

On numerical improvement of Gauss–Legendre quadrature rules

Among all integration rules with n points, it is well-known that n-point Gauss–Legendre quadrature rule∫₋₁¹f(x) dx∑_i=1ⁿw_if(x_i)has the highest possible precision degree and is analytically exact for polynomials of degree at most 2n−1, where nodes x_i are zeros of Legendre polynomial P_n(x), and w_i's are corresponding weights.In this paper we are going to estimate numerical values of nodes x_i and weights w_i so that the absolute error of introduced quadrature rule is less than a preassigned tolerance ε₀, say ε₀=10⁻⁸, for monomial functionsf(x)=x^j, j=0,1,…,2n+1.(Two monomials more than precision degree of Gauss–Legendre quadrature rules.) We also consider some conditions under which the new rules act, numerically, more accurate than the corresponding Gauss–Legendre rules. Some examples are given to show the numerical superiority of presented rules.     

About equivalent interval colorings of weighted graphs

Given a graph G=(V,E) with strictly positive integer weights ω_i on the vertices iV, a k-interval coloring of G is a function I that assigns an interval I(i){1,…,k} of ω_i consecutive integers (called colors) to each vertex iV. If two adjacent vertices x and y have common colors, i.e. I(i)∩I(j)≠0/ for an edge [i,j] in G, then the edge [i,j] is said conflicting. A k-interval coloring without conflicting edges is said legal. The interval coloring problem (ICP) is to determine the smallest integer k, called interval chromatic number of G and denoted χ_int(G), such that there exists a legal k-interval coloring of G. For a fixed integer k, the k-interval graph coloring problem (k-ICP) is to determine a k-interval coloring of G with a minimum number of conflicting edges. The ICP and k-ICP generalize classical vertex coloring problems where a single color has to be assigned to each vertex (i.e., ω_i=1 for all vertices iV).Two k-interval colorings I₁ and I₂ are said equivalent if there is a permutation π of the integers 1,…,k such that ℓI₁(i) if and only if π(ℓ)I₂(i) for all vertices iV. As for classical vertex coloring, the efficiency of algorithms that solve the ICP or the k-ICP can be increased by avoiding considering equivalent k-interval colorings, assuming that they can be identified very quickly. To this purpose, we define and prove a necessary and sufficient condition for the equivalence of two k-interval colorings. We then show how a simple tabu search algorithm for the k-ICP can possibly be improved by forbidding the visit of equivalent solutions.     

Gotzmann Edge Ideals

Let P = 𝕜[x ₁,…, x _n ] be the polynomial ring in n variables. A homogeneous ideal I ? P generated in degree d is called Gotzmann if it has the smallest possible Hilbert function out of all homogeneous ideals with the same dimension in degree d. The edge ideal of a simple graph G on vertices x ₁,…, x _n is the quadratic square-free monomial ideal generated by all x _i x _j where {x _i , x _j } is an edge of G. The only edge ideals that are Gotzmann are those edge ideals corresponding to star graphs.     

Effacement des dérivations et spectres premiers des algèbres quantiques

Given any (commutative) field k and any iterated Ore extension R=k[X₁][X₂;σ₂,δ₂][X_N;σ_N,δ_N] satisfying some suitable assumptions, we construct the so-called “Derivative-Elimination Algorithm.” It consists of a sequence of changes of variables inside the division ring F=Fract(R), starting with the indeterminates (X₁,…,X_N) and terminating with new variables (T₁,…,T_N). These new variables generate some quantum-affine space such that . This algorithm induces a natural embedding which satisfies the following property:

Full-size image

. We study both the derivative-elimination algorithm and natural embedding and use them to produce, for the general case, a (common) proof of the “quantum Gelfand–Kirillov” property for the prime homomorphic images of the following quantum algebras: , (wW), R_q[G] (where G denotes any complex, semi-simple, connected, simply connected Lie group with associated Lie algebra and Weyl group W), quantum matrices algebras, quantum Weyl algebras and quantum Euclidean (respectively symplectic) spaces. Another application will be given in [G. Cauchon, J. Algebra, to appear]: In the general case, the prime spectrum of any quantum matrices algebra satisfies the normal separation property.     

Constant-sign solutions for systems of singular integral equations of Hammerstein type

We consider the system of Hammerstein integral equations

where T>0 is fixed, ρ_i’s are given functions and the nonlinearities f_i(t,x₁,x₂,…,x_n) can be singular at t=0 and x_j=0 where j{1,2,,n}. Criteria are offered for the existence of constant-sign solutions, i.e., θ_iu_i(t)≥0 for t[0,T] and 1≤i≤n, where θ_i{1,−1} is fixed. The tools used are a nonlinear alternative of Leray–Schauder type, Krasnosel’skii’s fixed point theorem in a cone and Schauder’s fixed point theorem. We also include examples and applications to illustrate the usefulness of the results obtained.     

Multivariate matching polynomials of cyclically labelled graphs

We consider the matching polynomials of graphs whose edges have been cyclically labelled with the ordered set of t labels {x₁,…,x_t}.We first work with the cyclically labelled path, with first edge label x_i, followed by N full cycles of labels {x₁,…,x_t}, and last edge label x_j. Let Φ_i,Nt+j denote the matching polynomial of this path. It satisfies the (τ,Δ)-recurrence: , where τ is the sum of all non-consecutive cyclic monomials in the variables {x₁,…,x_t} and . A combinatorial/algebraic proof and a matrix proof of this fact are given. Let G_N denote the first fundamental solution to the (τ,Δ)-recurrence. We express G_N (i) as a cyclic binomial using the symmetric representation of a matrix, (ii) in terms of Chebyshev polynomials of the second kind in the variables τ and Δ, and (iii) as a quotient of two matching polynomials. We extend our results from paths to cycles and rooted trees.     

Gray codes for column-convex polyominoes and a new class of distributive lattices

We introduce the problem of polyomino Gray codes, which is the listing of all members of certain classes of polyominoes such that successive polyominoes differ by some well-defined closeness condition (e.g., the movement of one cell). We discuss various closeness conditions and provide several Gray codes for the class of column-convex polyominoes with a fixed number of cells in each column. For one of our closeness conditions, a natural new class of distributive lattice arises: the partial order is defined on the set of m-tuples [S₁]×[S₂]××[S_m], where each S_i>1 and [S_i]={0,1,…,S_i−1}, and the cover relations are (p₁,p₂,…,p_m)(p₁+1,p₂,…,p_m) and (p₁,p₂,…,p_j,p_j+1,…,p_m)(p₁,p₂,…,p_j−1,p_j+1+1,…,p_m). We also discuss some properties of this lattice.     

A sufficient condition for pairing problem of generators in symmetrizable Kac–Moody algebras

In a symmetrizable Kac–Moody algebra g(A), let α=∑_i=1ⁿk_iα_i be an imaginary root satisfying k_i>0 and α,α_i<0 for i=1,2,…,n. In this paper, it is proved that for any x_αg_α{0}, satisfying [x_α,f_n]≠0 and [x_α,f_i]=0 for i=1,2,…,n−1, there exists a vector y such that the subalgebra generated by x_α and y contains g′(A), the derived subalgebra of g(A).     

A discrete Korovkin theorem

In this paper we give a sufficient condition for the pointwise Korovkin property on B(X), the space of bounded real valued functions on an arbitrary countable set X = {x_l,…, x_j,…}. Our theorem follows from its L_p(X, μ) analogue (and conversely); here 1 p < ∞ and μ is a positive finite measure on X such that μ({x_j}) > 0 for all j.     

A degree condition for the circumference of a graph

We present a new condition on the degree sums of a graph that implies the existence of a long cycle. Let c(G) denote the length of a longest cycle in the graph G and let m be any positive integer. Suppose G is a 2-connected graph with vertices x₁,…,x_n and edge set E that satisfies the property that, for any two integers j and k with j < k, x_jx_k ? E, d(x_i) ? j and d(x_k) ? K - 1, we have (1) d(x_i) + d(x_k ? m if j + k ? n and (2) if j + k < n, either m ? n or d(x_j) + d(x_k) ? min(K + 1,m). Then c(G) ? min(m, n). This result unifies previous results of J.C. Bermond and M. Las Vergnas, respectively.     

Induced disjoint paths problem in a planar digraph

As an extension of the disjoint paths problem, we introduce a new problem which we call the induced disjoint paths problem. In this problem we are given a graph G and a collection of vertex pairs {(s₁,t₁),…,(s_k,t_k)}. The objective is to find k paths P₁,…,P_k such that P_i is a path from s_i to t_i and P_i and P_j have neither common vertices nor adjacent vertices for any distinct i,j.The induced disjoint paths problem has several variants depending on whether k is a fixed constant or a part of the input, whether the graph is directed or undirected, and whether the graph is planar or not. We investigate the computational complexity of several variants of the induced disjoint paths problem. We show that the induced disjoint paths problem is (i) solvable in polynomial time when k is fixed and G is a directed (or undirected) planar graph, (ii) NP-hard when k=2 and G is an acyclic directed graph, (iii) NP-hard when k=2 and G is an undirected general graph.As an application of our first result, we show that we can find in polynomial time certain structures called a “hole” and a “theta” in a planar graph.     

Betti Numbers of Path Ideals of Trees

Let R = k[x₁,…, x_n], where k is a field. The path ideal (of length t) of a directed graph G is the monomial ideal, denoted by I_t(G), whose generators correspond to the directed paths of length t in G. We determine all the graded Betti numbers of the path ideal of a directed rooted tree with respect to some graphical terms.     

Uniqueness of limit cycles for polynomial first-order differential equations

We study the uniqueness of limit cycles (periodic solutions that are isolated in the set of periodic solutions) in the scalar ODE in terms of {i_k}, {j_k}, {n_k}. Our main result characterizes, under some additional hypotheses, the exponents {i_k}, {j_k}, {n_k}, such that for any choice of the equation has at most one limit cycle. The obtained results have direct application to rigid planar vector fields, thus, planar systems of the form x^′=y+xR(x,y), y^′=−x+yR(x,y), where . Concretely, when the set has at least three elements (or exactly one) and another technical condition is satisfied, we characterize the exponents {i_k}, {j_k} such that the origin of the rigid system is a center for any choice of and also when there are no limit cycles surrounding the origin for any choice of .     

On consecutive edge magic total labeling of graphs

Let G=(V,E) be a finite (non-empty) graph, where V and E are the sets of vertices and edges of G. An edge magic total labeling is a bijection α from VE to the integers 1,2,…,n+e, with the property that for every xyE, α(x)+α(y)+α(xy)=k, for some constant k. Such a labeling is called an a-vertex consecutive edge magic total labeling if α(V)={a+1,…,a+n} and a b-edge consecutive edge magic total if α(E)={b+1,b+2,…,b+e}. In this paper we study the properties of a-vertex consecutive edge magic and b-edge consecutive edge magic graphs.     

Fast pattern-matching on indeterminate strings

In a string x on an alphabet Σ, a position i is said to be indeterminate iff x[i] may be any one of a specified subset {λ₁,λ₂,…,λ_j} of Σ, 2j|Σ|. A string x containing indeterminate positions is therefore also said to be indeterminate. Indeterminate strings can arise in DNA and amino acid sequences as well as in cryptological applications and the analysis of musical texts. In this paper we describe fast algorithms for finding all occurrences of a pattern p=p[1..m] in a given text x=x[1..n], where either or both of p and x can be indeterminate. Our algorithms are based on the Sunday variant of the Boyer–Moore pattern-matching algorithm, one of the fastest exact pattern-matching algorithms known. The methodology we describe applies more generally to all variants of Boyer–Moore (such as Horspool's, for example) that depend only on calculation of the δ (“rightmost shift”) array: our method therefore assumes that Σ is indexed (essentially, an integer alphabet), a requirement normally satisfied in practice.     

L∞-upper bound of L2-projections onto splines at a geometric mesh

For an integer k 1 and a geometric mesh (qⁱ)_−∞^∞ with q ε (0, ∞), let M_i,k(x): = k[q^{i + k}](· − x)₊^{k − 1}, N_i,k(x): = (q^{i + k} − qⁱM_i,k(x)/k, and let A_k(q) be the Gram matrix (∝M_i,kN_j,k)_i,jεz. It is known that A_k(q)⁻¹_∞ is bounded independently of q. In this paper it is shown that A_k(q)⁻¹_∞ is strictly decreasing for q in [1, ∞). In particular, the sharp upper bound and lower bound for A_k (q)⁻¹ are obtained: for all q ε (0, ∞).