Equivariant Cobordism of Torus Orbifolds

Torus orbifolds are topological generalizations of symplectic toric orbifolds.The authours give a construction of smooth orbifolds with torus actions whose boundary is a disjoint union of torus orbifolds using a toric topological method. As a result, they show that any orientable locally standard torus orbifold is equivariantly cobordant to some copies of orbifold complex projective spaces. They also discuss some further equivariant cobordism results including the cases when torus orbifolds are actually torus manifolds.     

Type and conductor of simplicial affine semigroups

We provide a generalization of pseudo-Frobenius numbers of numerical semigroups to the context of the simplicial affine semigroups. In this way, we characterize the Cohen-Macaulay type of the simplicial affine semigroup ring $\mathbb{K}[S]$. We define the type of S, $\mathrm{type}(S)$, in terms of some Apéry sets of S and show that it coincides with the Cohen-Macaulay type of the semigroup ring, when $\mathbb{K}[S]$ is Cohen-Macaulay. If $\mathbb{K}[S]$ is a d-dimensional Cohen-Macaulay ring of embedding dimension at most $d+2$, then $\mathrm{type}(S)\le 2$. Otherwise, $\mathrm{type}(S)$ might be arbitrary large and it has no upper bound in terms of the embedding dimension. Finally, we present a generating set for the conductor of S as an ideal of its normalization.     

Vanishing conditions for the simplicial volume of compact complex varieties

Gromov has defined a notion of simplicial volume: it is a topological invariant for compact manifolds which is closely related to the fundamental group. We investigate here the relevance of this notion in the realm of complex varieties.

     

Tchebyshev triangulations of stable simplicial complexes

We generalize the notion of the Tchebyshev transform of a graded poset to a triangulation of an arbitrary simplicial complex in such a way that, at the level of the associated F-polynomials j_∑fj−1(j(x−1)/2), the triangulation induces taking the Tchebyshev transform of the first kind. We also present a related multiset of simplicial complexes whose association induces taking the Tchebyshev transform of the second kind. Using the reverse implication of a theorem by Schelin we observe that the Tchebyshev transforms of Schur stable polynomials with real coefficients have interlaced real roots in the interval (−1,1), and present ways to construct simplicial complexes with Schur stable F-polynomials. We show that the order complex of a Boolean algebra is Schur stable. Using and expanding the recently discovered relation between the derivative polynomials for tangent and secant and the Tchebyshev polynomials we prove that the roots of the corresponding pairs of derivative polynomials are all pure imaginary, of modulus at most one, and interlaced.     

Shellable graphs and sequentially Cohen-Macaulay bipartite graphs

Associated to a simple undirected graph G is a simplicial complex ΔG whose faces correspond to the independent sets of G. We call a graph G shellable if ΔG is a shellable simplicial complex in the non-pure sense of Björner-Wachs. We are then interested in determining what families of graphs have the property that G is shellable. We show that all chordal graphs are shellable. Furthermore, we classify all the shellable bipartite graphs; they are precisely the sequentially Cohen-Macaulay bipartite graphs. We also give a recursive procedure to verify if a bipartite graph is shellable. Because shellable implies that the associated Stanley-Reisner ring is sequentially Cohen-Macaulay, our results complement and extend recent work on the problem of determining when the edge ideal of a graph is (sequentially) Cohen-Macaulay. We also give a new proof for a result of Faridi on the sequentially Cohen-Macaulayness of simplicial forests.     

On orthogonal ray graphs

An orthogonal ray graph is an intersection graph of horizontal and vertical rays (half-lines) in the xy-plane. An orthogonal ray graph is a 2-directional orthogonal ray graph if all the horizontal rays extend in the positive x-direction and all the vertical rays extend in the positive y-direction. We first show that the class of orthogonal ray graphs is a proper subset of the class of unit grid intersection graphs. We next provide several characterizations of 2-directional orthogonal ray graphs. Our first characterization is based on forbidden submatrices. A characterization in terms of a vertex ordering follows immediately. Next, we show that 2-directional orthogonal ray graphs are exactly those bipartite graphs whose complements are circular arc graphs. This characterization implies polynomial-time recognition and isomorphism algorithms for 2-directional orthogonal ray graphs. It also leads to a characterization of 2-directional orthogonal ray graphs by a list of forbidden induced subgraphs. We also show a characterization of 2-directional orthogonal ray trees, which implies a linear-time algorithm to recognize such trees. Our results settle an open question of deciding whether a (0,1)-matrix can be permuted to avoid the submatrices .     

On the Equivalence of Integral T^k-Cohomology Chern Numbers and T^k-K-Theoretic Chern Numbers

This paper mainly deals with the question of equivalence between equivariant cohomology Chern numbers and equivariant K-theoretic Chern numbers when the transformation group is a torus.By using the equivariant Riemann-Roch relation of AtiyahHirzebruch type,it is proved that the vanishing of equivariant cohomology Chern numbers is equivalent to the vanishing of equivariant K-theoretic Chern numbers.     

Socles of Buchsbaum modules, complexes and posets

The socle of a graded Buchsbaum module is studied and is related to its local cohomology modules. This algebraic result is then applied to face enumeration of Buchsbaum simplicial complexes and posets. In particular, new necessary conditions on face numbers and Betti numbers of such complexes and posets are established. These conditions are used to settle in the affirmative Kühnel's conjecture for the maximum value of the Euler characteristic of a 2k-dimensional simplicial manifold on n vertices as well as Kalai's conjecture providing a lower bound on the number of edges of a simplicial manifold in terms of its dimension, number of vertices, and the first Betti number.     

Random graphs and covering graphs of posets

For a graph G, we define c(G) to be the minimal number of edges we must delete in order to make G into a covering graph of some poset. We prove that, if p=n ^-1+(n) ,where (n) is bounded away from 0, then there is a constant k ₀>0 such that, for a.e. G _p , c(G _p )k ₀ n ¹⁺⁽ⁿ⁾ .In other words, to make G _p into a covering graph, we must almost surely delete a positive constant proportion of the edges. On the other hand, if p=n ^-1+(n) , where (n)0, thenc(G _p )=o(n ¹⁺⁽ⁿ⁾ ), almost surely.Partially supported by MCS Grant 8104854.     

Combinatorial functional and differential equations applied to differential posets

We give combinatorial proofs of the primary results developed by Stanley for deriving enumerative properties of differential posets. In order to do this we extend the theory of combinatorial differential equations developed by Leroux and Viennot.     

Efficiency and implementation of simplicial zero point algorithms

In this paper we compare the efficiency of several simplicial variable dimension algorithms. To do so, we first treat the issues of degeneracy and accelerating. We present a device for solving degeneracy. Furthermore we compare several accelerating techniques. The technique of iterated quasi-Newton steps after each major cycle of the simplicial algorithm is implemented in a computer code, which is used to compare the efficiency of the (n+1)-ray, 2n-ray, 2 ⁿ -ray and (3 ⁿ −1)-ray algorithms. Except for the (n+1)-ray algorithm, the number of function evaluations does not differ very much between the various algorithms. It appeared, however, that the 2 ⁿ -algorithm needs considerably less computation time.     

Cyclic cohomology of Banach algebras of quivers and their inverse semigroups

In this paper, we consider the path semigroup ?¹${?}^1$-algebra for a quiver and the inverse semigroup ?¹${?}^1$-algebra of a quiver, the latter of which can be used in the construction of Cuntz–Krieger algebras. The main objectives of the paper are to determine the simplicial and cyclic cohomology groups of these algebras. First, we determine the simplicial and cyclic cohomology of the path algebra of the quiver, showing the simplicial cohomology groups of dimension n   vanish for n>1$n>1$. We then determine the simplicial and cyclic cohomology of the inverse semigroup algebra. The work uses the Connes–Tzygan long exact sequence.     

The signed domatic number of some regular graphs

Let G be a finite and simple graph with vertex set V(G), and let f:V(G)→{−1,1} be a two-valued function. If ∑_x∈N[v]f(x)≥1 for each v∈V(G), where N[v] is the closed neighborhood of v, then f is a signed dominating function on G. A set {f₁,f₂,…,f_d} of signed dominating functions on G with the property that for each x∈V(G), is called a signed dominating family (of functions) on G. The maximum number of functions in a signed dominating family on G is the signed domatic number on G. In this paper, we investigate the signed domatic number of some circulant graphs and of the torus C_p×C_q.     

Relations between simplicial groups, 3-crossed modules and 2-quadratic modules

In this paper, we define two-quadratic module and explore the relations among two-quadratic modules, three-crossed modules and simplicial groups.     

Some criteria for the Cohen-Macaulay property and local cohomology

Let a be an ideal of a commutative Noetherian ring R and M be a finitely generated R-module of dimension d. We characterize Cohen-Macaulay rings in term of a special homological dimension. Lastly, we prove that if R is a complete local ring, then the Matlis dual of top local cohomology module Ha^d（M） is a Cohen-Macaulay R-module provided that the R-module M satisfies some conditions.     

Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs

A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. A graph G is clique-perfect if the sizes of a minimum clique-transversal and a maximum clique-independent set are equal for every induced subgraph of G. The list of minimal forbidden induced subgraphs for the class of clique-perfect graphs is not known. Another open question concerning clique-perfect graphs is the complexity of the recognition problem. Recently we were able to characterize clique-perfect graphs by a restricted list of forbidden induced subgraphs when the graph belongs to two different subclasses of claw-free graphs. These characterizations lead to polynomial time recognition of clique-perfect graphs in these classes of graphs. In this paper we solve the characterization problem in two new classes of graphs: diamond-free and Helly circular-arc () graphs. This last characterization leads to a polynomial time recognition algorithm for clique-perfect graphs.