Shortest path poset of Bruhat intervals

We define the shortest path poset SP(u,v) of a Bruhat interval [u,v], by considering the shortest u–v paths in the Bruhat graph of a Coxeter group W, where u,v∈W. We consider the case of SP(u,v) having a unique rising chain under a reflection order and show that in this case SP(u,v) is a Gorenstein^? poset. This allows us to derive the nonnegativity of certain coefficients of the complete cd-index. We furthermore show that the shortest path poset of an irreducible, finite Coxeter group exhibits a symmetric chain decomposition.     

Stable structures homogeneous for a finite binary language

LetL be a finite relational language andH(L) denote the class of all countable stableL-structuresM for which Th(M) admits elimination of quantifiers. ForM ∈H(L) define the rank ofM to be the maximum value of CR(p, 2), wherep is a complete 1-type over Ø and CR(p, 2) is Shelah’s complete rank. IfL has only unary and binary relation symbols there is a uniform finite bound for the rank ofM ∈H(L). This theorem confirms part of a conjecture of the first author. Intuitively it says that for eachL there is a finite bound on the complexity of the structures inH(L).     

Flag enumerations of matroid base polytopes

In this paper, we study flag structures of matroid base polytopes. We describe faces of matroid base polytopes in terms of matroid data, and give conditions for hyperplane splits of matroid base polytopes. Also, we show how the cd-index of a polytope can be expressed when a polytope is split by a hyperplane, and apply these to the cd-index of a matroid base polytope of a rank 2 matroid.     

Squarefree P-modules and the cd-index

In this paper, we introduce a new algebraic concept, which we call squarefree P-modules. This concept is inspired from Karu's proof of the non-negativity of the cd-indices of Gorenstein* posets, and supplies a way to study cd-indices from the viewpoint of commutative algebra. Indeed, by using the theory of squarefree P-modules, we give several new algebraic and combinatorial results on CW-posets. First, we define an analogue of the cd-index for any CW-poset and prove its non-negativity when a CW-poset is Cohen–Macaulay. This result proves that the h-vector of the barycentric subdivision of a Cohen–Macaulay regular CW-complex is unimodal. Second, we prove that the Stanley–Reisner ring of the barycentric subdivision of an odd dimensional Cohen–Macaulay polyhedral complex has the weak Lefschetz property. Third, we obtain sharp upper bounds of the cd-indices of Gorenstein* posets for a fixed rank generating function.     

Level Eulerian Posets

The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the longest interval one needs to check to verify Eulerianness. Furthermore, we show that every level Eulerian poset associated to an indecomposable matrix has even order. A condition for verifying shellability is introduced and is automated using the algebra of walks. Applying the Skolem–Mahler–Lech theorem, the ab-series of a level poset is shown to be a rational generating function in the non-commutative variables a and b. In the case the poset is also Eulerian, the analogous result holds for the cd-series. Using coalgebraic techniques a method is developed to recognize the cd-series matrix of a level Eulerian poset.     

Variational Inequalities: an Elementary Approach

We will deal with the following problem: Let M be an n×n matrix with real entries. Under which conditions the family of inequalities: x∈? ⁿ ;x?0;M·x?0has non–trivial solutions? We will prove that a sufficient condition is given by m_i,j+m_j,i?0 (1?i,j?n); from this result we will derive an elementary proof of the existence theorem for Variational Inequalities in the framework of Monotone Operators.     

Peak quasisymmetric functions and Eulerian enumeration

Via duality of Hopf algebras, there is a direct association between peak quasisymmetric functions and enumeration of chains in Eulerian posets. We study this association explicitly, showing that the notion of cd-index, long studied in the context of convex polytopes and Eulerian posets, arises as the dual basis to a natural basis of peak quasisymmetric functions introduced by Stembridge. Thus Eulerian posets having a nonnegative cd-index (for example, face lattices of convex polytopes) correspond to peak quasisymmetric functions having a nonnegative representation in terms of this basis. We diagonalize the operator that associates the basis of descent sets for all quasisymmetric functions to that of peak sets for the algebra of peak functions, and study the g-polynomial for Eulerian posets as an algebra homomorphism.     

Spaces of Riemannian metrics on open manifolds

We define for the set M of metrics on an open manifold M ⁿ suitable uniform structures, obtain completed spaces ^b,m M or M ^r (I, B _k ), respectively and calculate for each component of M ^r (I, B _k ) the infinitedimensional geometry. In particular, we show that the sectional curvature is non positive.     

CAT(0) 4-manifolds possessing a single tame point are Euclidean

The concepts of geometric and topological tame point are introduced for a space of nonpositive curvature. These concepts are applied to the characterization problem forCAT(0) 4-manifolds. It is shown that everyCAT(0)M ⁴ having a single (geometric or topological) tame point is homeomorphic toR ⁴. Davis and Januszkiewicz have recently constructedCAT(0)n-manifolds,M ⁿ withn ≥ 5 such that the set of tame points form a dense open subset ofM ⁿ , butM ⁿ ≠R ⁿ .     

Linear maps preserving M–P inverses of matrices between matrix spaces over fields

Suppose F is a field of characteristic not 2. Let n and m be two arbitrary positive integers with n≥2. We denote by M _n (F) and S _n (F) the space of n×n full matrices and the space of n×n symmetric matrices over F, respectively. All linear maps from S _n (F) to M _m (F) preserving M–P inverses of matrices are characterized first, and thereby all linear maps from S _n (F) (M _n (F)) to S _m (F) (M _m (F)) preserving M–P inverses of matrices are characterized, respectively.     

Galois groups of multivariate Tutte polynomials

The multivariate Tutte polynomial $\hat{Z}_{M}$ of a matroid M is a generalization of the standard two-variable version, obtained by assigning a separate variable v _e to each element e of the ground set E. It encodes the full structure of M. Let v={v _e } _e??E , let K be an arbitrary field, and suppose M is connected. We show that $\hat{Z}_{M}$ is irreducible over K(v), and give three self-contained proofs that the Galois group of $\hat{Z}_{M}$ over K(v) is the symmetric group of degree n, where n is the rank of M. An immediate consequence of this result is that the Galois group of the multivariate Tutte polynomial of any matroid is a direct product of symmetric groups. Finally, we conjecture a similar result for the standard Tutte polynomial of a connected matroid.     

An interior point potential reduction algorithm for the linear complementarity problem

The linear complementarity problem (LCP) can be viewed as the problem of minimizingx ^T y subject toy=Mx+q andx, y?0. We are interested in finding a point withx ^T y <ε for a givenε > 0. The algorithm proceeds by iteratively reducing the potential function $$f(x,y) = \rho \ln x^T y - \Sigma \ln x_j y_j ,$$ where, for example,ρ=2n. The direction of movement in the original space can be viewed as follows. First, apply alinear scaling transformation to make the coordinates of the current point all equal to 1. Take a gradient step in the transformed space using the gradient of the transformed potential function, where the step size is either predetermined by the algorithm or decided by line search to minimize the value of the potential. Finally, map the point back to the original space. A bound on the worst-case performance of the algorithm depends on the parameterλ ^*=λ^*(M, ε), which is defined as the minimum of the smallest eigenvalue of a matrix of the form $$(I + Y^{ - 1} MX)(I + M^T Y^{ - 2} MX)^{ - 1} (I + XM^T Y^{ - 1} )$$ whereX andY vary over the nonnegative diagonal matrices such thate ^T XYe ?ε andX _jj Y _jj?n ². IfM is a P-matrix,λ ^* is positive and the algorithm solves the problem in polynomial time in terms of the input size, |log ε|, and 1/λ ^*. It is also shown that whenM is positive semi-definite, the choice ofρ = 2n+ \(\sqrt {2n} \) yields a polynomial-time algorithm. This covers the convex quadratic minimization problem.     

Biharmonic Submanifolds in a Riemannian Manifold with Non-Positive Curvature

In this paper, we show that, for every biharmonic submanifold (M, g) of a Riemannian manifold (N, h) with non-positive sectional curvature, if ${\int_M\vert \eta \vert^2 v_g < \infty}$ , then (M, g) is minimal in (N, h), i.e., ${\eta\equiv0}$ , where η is the mean curvature tensor field of (M, g) in (N, h). This result gives an affirmative answer under the condition ${\int_M\vert \eta \vert^2 v_g < \infty}$ to the following generalized Chen’s conjecture: every biharmonic submanifold of a Riemannian manifold with non-positive sectional curvature must be minimal. The conjecture turned out false in case of an incomplete Riemannian manifold (M, g) by a counter example of Ou and Tang (in The generalized Chen’s conjecture on biharmonic sub-manifolds is false, a preprint, 2010).     

Concentration inequalities and confidence bands for needlet density estimators on compact homogeneous manifolds

Let X ₁, . . . , X _n be a random sample from some unknown probability density f defined on a compact homogeneous manifold M of dimension d ≥ 1. Consider a ‘needlet frame’ ${\{\phi_{j\eta}\}}$ describing a localised projection onto the space of eigenfunctions of the Laplace operator on M with corresponding eigenvalues less than 2^2j , as constructed in Geller and Pesenson (J Geom Anal 2011). We prove non-asymptotic concentration inequalities for the uniform deviations of the linear needlet density estimator f _n (j) obtained from an empirical estimate of the needlet projection ${\sum_\eta \phi_{j \eta}\int f \phi_{j \eta}}$ of f. We apply these results to construct risk-adaptive estimators and nonasymptotic confidence bands for the unknown density f. The confidence bands are adaptive over classes of differentiable and H?lder-continuous functions on M that attain their H?lder exponents.     

On Lattice Coverings of Nil Space by Congruent Geodesic Balls

Nil geometry is one of the eight 3-dimensional Thurston geometries, it can be derived from W. Heisenberg’s famous real matrix group. The aim of this paper is to study lattice-like ball coverings in Nil space. We introduce the notion of the density of the considered coverings and give upper and lower estimates to it, moreover in Section 3, we formulate a conjecture for the ball arrangement of the least dense latticelike geodesic ball covering and give its covering density ${\triangle \approx 1.42900615}$ . The homogeneous 3-spaces have a unified interpretation in the projective 3-sphere and in our work we will use this projective model.     

Additive operators preserving rank-additivity on symmetry matrix spaces

We characterize the additive operators preserving rank-additivity on symmetry matrix spaces. LetS _n(F) be the space of alln×n symmetry matrices over a fieldF with 2,3 ∈F ^*, thenT is an additive injective operator preserving rank-additivity onS _n(F) if and only if there exists an invertible matrixU∈M _n(F) and an injective field homomorphism ? ofF to itself such thatT(X)=cUX ^?U^T, ?X=(x_ij)∈S_n(F) wherec∈F ^*,X ^?=(?(x _ij)). As applications, we determine the additive operators preserving minus-order onS _n(F) over the fieldF.     

On lattices of congruences of relational systems and universal algebras

Let \(\mathfrak{X}\) =〈X;R〉 be a relational system.X is a non-empty set andR is a collection of subsets ofX ^α, α an ordinal. The system of equivalence relations onX having the substitution property with respect to members ofR form a complete latticeC( \(\mathfrak{X}\) ) containing the identity but not necessarilyX×X. It is shown that for any relational system (X;R) there is a groupoid definable onX whose congruence lattice isC( \(\mathfrak{X}\) )U{X×X} . Theorem 2 and Corollary 2 contain some interesting combinatorial pecularities associated with oriented complete graphs and simple groupoids.     

Exemples de comptages de courbes sur les surfaces

Some examples of curves countings on surfaces Let $X$ be a surface whose Cox ring has a single relation satisfying moreover a kind of linearity property. We show that the geometric Manin’s conjectures hold for some degrees lying in the dual of the effective cone of $X$ (in particular, for those degrees the moduli space of morphisms has the expected dimension). The result applies to a class of generalized del Pezzo surfaces which has been intensively studied in the context of the arithmetic Manin’s conjecture.     

Generation and Enumeration of Some Classes of Interval Orders

In this paper we consider the class of interval orders, recently considered by several authors from both an algebraic and an enumerative point of view. According to Fishburn’s Theorem (Fishburn J Math Psychol 7:144–149, 1970), these objects can be characterized as posets avoiding the poset 2?+?2. We provide a recursive method for the unique generation of interval orders of size n?+?1 from those of size n, extending the technique presented by El-Zahar (1989) and then re-obtain the enumeration of this class, as done in Bousquet-Melou et al. (2010). As a consequence we provide a method for the enumeration of several subclasses of interval orders, namely AV(2?+?2, N), AV(2?+?2, 3?+?1), AV(2?+?2, N, 3?+?1). In particular, we prove that the first two classes are enumerated by the sequence of Catalan numbers, and we establish a bijection between the two classes, based on the cardinalities of the principal ideals of the posets.