All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

1 615 (0,08s)

Result

SHELLINGS AND SHEDDINGS INDUCED BY COLLAPSES

vertex of a pure 2-dimensional simplicial complex K is connected and K becomes of decomposability of a simplicial complex, stronger than vertex decomposability, which we callWe say that a pure simplicial ...

Pure mathematics

  • 2021
  • Jimp
  • Link
Result

LC reductions yield isomorphic simplicial complexes

We say that a vertex v of a finite simplicial complex K is LC-removable if the link of v is a cone, and that K is LC-irreducible if it has no LC-removable vertices. Answering a question of Civan and Yalcin, we prove that all LC-irre...

BA - Obecná matematika

  • 2008
  • Jx
Result

Bisimulation for impure simplicial complexes

, a simplicial complex is a downward closed set of subsets, called simplexes, of the vertex set. A maximal simplex is called a facet. Impure simplicial complexes represent that some agents (processes) are dead. It is known ...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2024
  • D
Result

On the structure and clique-width of (4K1,C4,C6,C7)-free graphs

We give a complete structural description of (4K1,C4,C6,C7)-free graphs that do not contain a simplicial vertex, and we prove that such graphs have bounded clique-width. Together with the results of Foley et al., this implies that ...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2022
  • Jimp
  • Link
Result

Simplicial vertex-normal duality with applications to well-centered simplices

We study the relation between the set of n + 1 vertices of an n-simplex S having S n−1 as circumsphere, and the set of n + 1 unit outward normals to the facets of S. These normals can in turn be interpreted as the vertices of another simplex S^ that ...

Pure mathematics

  • 2019
  • D
  • Link
Result

Approximations of the partial derivatives by averaging

vertices of conformal simplicial triangulations of bounded polytopic domains in the polynomial Lagrange finite element spaces of degree k on the simplices with vertex a only....

BA - Obecná matematika

  • 2012
  • Jx
Result

Complexity of the method of averaging

The general method of averaging for the superapproximation of an arbitrary partial derivative of a smooth function in a vertex a of a simplicial triangulation T of a bounded polytopic domain in of an arbitrary dimension d > 1 is des...

BA - Obecná matematika

  • 2011
  • D
Result

Bisimplicial separators

that a minimal separator is k-simplicial if it can be covered by k cliques and denote by G(k) the class of all graphs in which each minimal separator is k-simplicial. We show). Next, we show that, for k >= 1, every nonnull graph...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2024
  • Jimp
  • Link
Result

Binary linear codes, dimers and hypermatrices

of a finite 3-dimensional cubic lattice as the determinant of the vertex-adjacency 3-matrix of a 2-dimensional simplicial complex which preserves the natural embedding......

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2017
  • JSC
  • Link
Result

A Model Category Structure on the Category of Simplicial Multicategories

We establish a Quillen model category structure on the category of symmetric simplicial multicategories. This model structure extends the model structure on simplicial categories due to J. Bergner....

BA - Obecná matematika

  • 2014
  • Jx
  • Link
  • 1 - 10 out of 1 615