scholarly journals A combinatorial description of topological complexity for finite spaces

2018 ◽  
Vol 18 (2) ◽  
pp. 779-796 ◽  
Author(s):  
Kohei Tanaka
Keyword(s):  
Topological Complexity ◽  
Combinatorial Description ◽  
Finite Spaces

Dehydration-driven evolution of topological complexity in ethylamonium uranyl selenates

2017 ◽  
Vol 247 ◽  
pp. 105-112 ◽  
Author(s):  
Vladislav V. Gurzhiy ◽  
Sergey V. Krivovichev ◽  
Ivan G. Tananaev
Keyword(s):  
Topological Complexity

scholarly journals Topological complexity of frictional interfaces: friction networks

2012 ◽  
Vol 19 (2) ◽  
pp. 215-225 ◽  
Author(s):  
H. O. Ghaffari ◽  
R. P. Young
Keyword(s):  
Topological Complexity ◽  
Type Ii ◽  
Stored Energy ◽  
Fracture Permeability ◽  
Radiated Energy ◽  
Universal Power Law ◽  
Shear Rupture ◽  
Crack Type ◽  
Network Properties ◽  
Highly Correlated

Abstract. Through research conducted in this study, a network approach to the correlation patterns of void spaces in rough fractures (crack type II) was developed. We characterized friction networks with several networks characteristics. The correlation among network properties with the fracture permeability is the result of friction networks. The revealed hubs in the complex aperture networks confirmed the importance of highly correlated groups to conduct the highlighted features of the dynamical aperture field. We found that there is a universal power law between the nodes' degree and motifs frequency (for triangles it reads T(k) ∝ kβ (β ≈ 2 ± 0.3)). The investigation of localization effects on eigenvectors shows a remarkable difference in parallel and perpendicular aperture patches. Furthermore, we estimate the rate of stored energy in asperities so that we found that the rate of radiated energy is higher in parallel friction networks than it is in transverse directions. The final part of our research highlights 4 point sub-graph distribution and its correlation with fluid flow. For shear rupture, we observed a similar trend in sub-graph distribution, resulting from parallel and transversal aperture profiles (a superfamily phenomenon).

scholarly journals One-point reductions of finite spaces,h–regular CW–complexes and collapsibility

2008 ◽  
Vol 8 (3) ◽  
pp. 1763-1780 ◽  
Author(s):  
Jonathan Barmak ◽  
Elias Minian
Keyword(s):  
Cw Complexes ◽  
Finite Spaces

scholarly journals Orthogonal Arrays with Parameters $OA(s^3,s^2+s+1,s,2)$ and 3-Dimensional Projective Geometries

10.37236/556 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Kazuaki Ishii
Keyword(s):  
Orthogonal Array ◽  
Prime Power ◽  
Orthogonal Arrays ◽  
3 Dimensional ◽  
Projective Geometries ◽  
Finite Spaces ◽  
Alpha Type

There are many nonisomorphic orthogonal arrays with parameters $OA(s^3,s^2+s+1,s,2)$ although the existence of the arrays yields many restrictions. We denote this by $OA(3,s)$ for simplicity. V. D. Tonchev showed that for even the case of $s=3$, there are at least 68 nonisomorphic orthogonal arrays. The arrays that are constructed by the $n-$dimensional finite spaces have parameters $OA(s^n, (s^n-1)/(s-1),s,2)$. They are called Rao-Hamming type. In this paper we characterize the $OA(3,s)$ of 3-dimensional Rao-Hamming type. We prove several results for a special type of $OA(3,s)$ that satisfies the following condition: For any three rows in the orthogonal array, there exists at least one column, in which the entries of the three rows equal to each other. We call this property $\alpha$-type. We prove the following. (1) An $OA(3,s)$ of $\alpha$-type exists if and only if $s$ is a prime power. (2) $OA(3,s)$s of $\alpha$-type are isomorphic to each other as orthogonal arrays. (3) An $OA(3,s)$ of $\alpha$-type yields $PG(3,s)$. (4) The 3-dimensional Rao-Hamming is an $OA(3,s)$ of $\alpha$-type. (5) A linear $OA(3,s)$ is of $\alpha $-type.

scholarly journals Combinatorial Expansions in $K$-Theoretic Bases

10.37236/2320 ◽  
2012 ◽  
Vol 19 (4) ◽  
Author(s):  
Jason Bandlow ◽  
Jennifer Morse
Keyword(s):  
Generating Functions ◽  
Symmetric Functions ◽  
Schur Functions ◽  
Geometric Information ◽  
Combinatorial Description ◽  
Littlewood Polynomials ◽  
Stanley Symmetric Functions ◽  
K Theory ◽  
Combinatorial Representation

We study the class $\mathcal C$ of symmetric functions whose coefficients in the Schur basis can be described by generating functions for sets of tableaux with fixed shape.  Included in this class are the Hall-Littlewood polynomials, $k$-Schur functions, and Stanley symmetric functions; functions whose Schur coefficients encode combinatorial, representation theoretic and geometric information. While Schur functions represent the cohomology of the Grassmannian variety of $GL_n$, Grothendieck functions $\{G_\lambda\}$ represent the $K$-theory of the same space.  In this paper, we give a combinatorial description of the coefficients when any element of $\mathcal C$ is expanded in the $G$-basis or the basis dual to $\{G_\lambda\}$.

scholarly journals Multi-cluster complexes

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Cesar Ceballos ◽  
Jean-Philippe Labbé ◽  
Christian Stump
Keyword(s):  
Coxeter Groups ◽  
Type A ◽  
Simplicial Complexes ◽  
Cluster Complex ◽  
Geometric Properties ◽  
Cluster Complexes ◽  
Combinatorial Description ◽  
Compatibility Relation ◽  
Positive Roots ◽  
International Audience

International audience We present a family of simplicial complexes called \emphmulti-cluster complexes. These complexes generalize the concept of cluster complexes, and extend the notion of multi-associahedra of types ${A}$ and ${B}$ to general finite Coxeter groups. We study combinatorial and geometric properties of these objects and, in particular, provide a simple combinatorial description of the compatibility relation among the set of almost positive roots in the cluster complex. Nous présentons une famille de complexes simpliciaux appelés \emphcomplexes des multi-amas. Ces complexes généralisent le concept de complexes des amas et étendent la notion de multi-associaèdre de type ${A}$ et ${B}$ aux groupes de Coxeter finis. Nous étudions des propriétés combinatoires et géométriques de ces objets et, en particulier nous fournissons une description combinatoire simple de la relation de compatibilité sur l'ensemble des racines presque positives du complexe des amas.

Sign in / Sign up

Export Citation Format

Share Document