Results 51 to 60 of about 104 (81)

Homotopy type of shellable $q$-complexes and their homology groups

open access: yes
25 pagesThe theory of shellable simplicial complexes brings together combinatorics, algebra, and topology in a remarkable way. Initially introduced by Alder for $q$-simplicial complexes, recent work of Ghorpade, Pratihar, and Randrianarisoa extends the ...
Verdure, Hugues   +4 more
core   +1 more source

On the correlation gap of matroids. [PDF]

open access: yesMath Program
Husić E, Koh ZK, Loho G, Végh LA.
europepmc   +1 more source

非対称な通信路と情報源の効率的なpolar符号化およびLDPC符号化

open access: yes, 2013
Channel coding and source coding are the most fundamental problems in information theory. Shannon formulated these problems and derived their theoretical limits on the efficiency of the codes.
本多 淳也, Honda Junya
core  

Plants have two minds as we do. [PDF]

open access: yesPlant Signal Behav
Kawano T   +6 more
europepmc   +1 more source

Knot theory and error-correcting codes. [PDF]

open access: yesDes Codes Cryptogr
Kılıç AB   +3 more
europepmc   +1 more source

A lattice framework for generalizing shellable complexes and matroids

open access: yes
28 pages, 1 figureWe introduce the notion of power lattices that unifies and extends the equicardinal geometric lattices, Cartesian products of subspace lattices, and multiset subset lattices, among several others.
Pratihar, Rakhi   +2 more
core   +1 more source

On off-diagonal Ramsey numbers for vector spaces over $\mathbb{F}_{2}$

open access: yes
For every positive integer $d$, we show that there must exist an absolute constant $c > 0$ such that the following holds: for any integer $n \geq cd^{7}$ and any red-blue coloring of the one-dimensional subspaces of $\mathbb{F}_{2}^{n}$, there must exist
Hunter, Zach, Pohoata, Cosmin
core  

Modular Arithmetic and Randomization for Exact Matroid Problems

open access: yes, 1990
F. Maffioli   +2 more
core  

Home - About - Disclaimer - Privacy