7,764 research outputs found
Rational convexity of non generic immersed lagrangian submanifolds
We prove that an immersed lagrangian submanifold in \C^n with quadratic
self-tangencies is rationally convex. This generalizes former results for the
embedded and the immersed transversal cases.Comment: 4 page
On Maximal Unbordered Factors
Given a string of length , its maximal unbordered factor is the
longest factor which does not have a border. In this work we investigate the
relationship between and the length of the maximal unbordered factor of
. We prove that for the alphabet of size the expected length
of the maximal unbordered factor of a string of length~ is at least
(for sufficiently large values of ). As an application of this result, we
propose a new algorithm for computing the maximal unbordered factor of a
string.Comment: Accepted to the 26th Annual Symposium on Combinatorial Pattern
Matching (CPM 2015
Adsorbent filled membranes for gas separation. Part 1. Improvement of the gas separation properties of polymeric membranes by incorporation of microporous adsorbents
The effect of the introduction of specific adsorbents on the gas separation properties of polymeric membranes has been studied. For this purpose both carbon molecular sieves and zeolites are considered. The results show that zeolites such as silicate-1, 13X and KY improve to a large extent the separation properties of poorly selective rubbery polymers towards a mixture of carbon dioxide/methane. Some of the filled rubbery polymers achieve intrinsic separation properties comparable to cellulose acetate, polysulfone or polyethersulfone. However, zeolite 5A leads to a decrease in permeability and an unchanged selectivity. This is due to the impermeable character of these particles, i.e. carbon dioxide molecules cannot diffuse through the porous structure under the conditions applied. Using silicate-1 also results in an improvement of the oxygen/nitrogen separation properties which is mainly due to a kinetic effect. Carbon molecular sieves do not improve the separation performances or only to a very small extent. This is caused by a mainly dead-end (not interconnected) porous structure which is inherent to their manufacturing process
Very fast relaxation in polycarbonate glass
Low-frequency Raman and inelastic neutron scattering of amorphous bis-phenol
A polycarbonate is measured at low temperature, and compared. The vibrational
density of states and light-vibration coupling coefficient are determined. The
frequency dependences of these parameters are explained by propagating
vibration modes up to an energy of about 1 meV, and fracton-like modes in more
cohesive domains at higher energies. The vibrational dynamics is in agreement
with a disorder in the glass, which is principally of bonding or of elasticity
instead of density.Comment: 15 pages, 6 figures, to be pub. in EPJ
Preparation of zeolite filled glassy polymer membranes
The incorporation of zeolite particles in the micrometer range into polymeric matrices was investigated as a way to improve the gas separation properties of the polymer materials used in the form of membranes. The adhesion between the polymer phase and the external surface of the particles appeared to be a major problem in the preparation of such membranes when the polymer is in the glassy state at room temperature. Various methods were investigated to improve the internal membrane structure, that is, surface modification of the zeolite external surface, preparation above the glass-transition temperature, and heat treatment. Improved structures were obtained as observed by scanning electron microscopy, but the influence on the gas separation properties was not in agreement with the observed structural improvements
Quantum integrability of quadratic Killing tensors
Quantum integrability of classical integrable systems given by quadratic
Killing tensors on curved configuration spaces is investigated. It is proven
that, using a "minimal" quantization scheme, quantum integrability is insured
for a large class of classic examples.Comment: LaTeX 2e, no figure, 35 p., references added, minor modifications. To
appear in the J. Math. Phy
Cellular spanning trees and Laplacians of cubical complexes
We prove a Matrix-Tree Theorem enumerating the spanning trees of a cell
complex in terms of the eigenvalues of its cellular Laplacian operators,
generalizing a previous result for simplicial complexes. As an application, we
obtain explicit formulas for spanning tree enumerators and Laplacian
eigenvalues of cubes; the latter are integers. We prove a weighted version of
the eigenvalue formula, providing evidence for a conjecture on weighted
enumeration of cubical spanning trees. We introduce a cubical analogue of
shiftedness, and obtain a recursive formula for the Laplacian eigenvalues of
shifted cubical complexes, in particular, these eigenvalues are also integers.
Finally, we recover Adin's enumeration of spanning trees of a complete colorful
simplicial complex from the cellular Matrix-Tree Theorem together with a result
of Kook, Reiner and Stanton.Comment: 24 pages, revised version, to appear in Advances in Applied
Mathematic
Simplicial matrix-tree theorems
We generalize the definition and enumeration of spanning trees from the
setting of graphs to that of arbitrary-dimensional simplicial complexes
, extending an idea due to G. Kalai. We prove a simplicial version of
the Matrix-Tree Theorem that counts simplicial spanning trees, weighted by the
squares of the orders of their top-dimensional integral homology groups, in
terms of the Laplacian matrix of . As in the graphic case, one can
obtain a more finely weighted generating function for simplicial spanning trees
by assigning an indeterminate to each vertex of and replacing the
entries of the Laplacian with Laurent monomials. When is a shifted
complex, we give a combinatorial interpretation of the eigenvalues of its
weighted Laplacian and prove that they determine its set of faces uniquely,
generalizing known results about threshold graphs and unweighted Laplacian
eigenvalues of shifted complexes.Comment: 36 pages, 2 figures. Final version, to appear in Trans. Amer. Math.
So
Simplicial and Cellular Trees
Much information about a graph can be obtained by studying its spanning
trees. On the other hand, a graph can be regarded as a 1-dimensional cell
complex, raising the question of developing a theory of trees in higher
dimension. As observed first by Bolker, Kalai and Adin, and more recently by
numerous authors, the fundamental topological properties of a tree --- namely
acyclicity and connectedness --- can be generalized to arbitrary dimension as
the vanishing of certain cellular homology groups. This point of view is
consistent with the matroid-theoretic approach to graphs, and yields
higher-dimensional analogues of classical enumerative results including
Cayley's formula and the matrix-tree theorem. A subtlety of the
higher-dimensional case is that enumeration must account for the possibility of
torsion homology in trees, which is always trivial for graphs. Cellular trees
are the starting point for further high-dimensional extensions of concepts from
algebraic graph theory including the critical group, cut and flow spaces, and
discrete dynamical systems such as the abelian sandpile model.Comment: 39 pages (including 5-page bibliography); 5 figures. Chapter for
forthcoming IMA volume "Recent Trends in Combinatorics
- …