Zobrazeno 1 - 10
of 455
pro vyhledávání: '"P Pudlák"'
Autor:
Pudlak, M., Nazmitdinov, R. G.
Publikováno v:
Phys.Rev.B 109 (2024) 205402
Graphene corrugations affect hybridization of $\pi$ and $\sigma$ orbitals of carbon atoms in graphene based systems. It can as well break differently the symmetry of the electron transfer integrals for different strip boundaries. Using these facts, w
Externí odkaz:
http://arxiv.org/abs/2404.13338
Depth-3 circuit lower bounds and $k$-SAT algorithms are intimately related; the state-of-the-art $\Sigma^k_3$-circuit lower bound and the $k$-SAT algorithm are based on the same combinatorial theorem. In this paper we define a problem which reveals n
Externí odkaz:
http://arxiv.org/abs/2403.09134
Autor:
Pudlák, Pavel, Rödl, Vojtěch
According to Ramsey theorem, for every $k$ and $n$, if $N$ is sufficiently large, then for every 2-coloring $\psi$ of $k$-element subsets of $[N]$ there exists a monochromatic set $S\subseteq[N]$ (a set such that all $k$-element subsets of $S$ have t
Externí odkaz:
http://arxiv.org/abs/2402.05286
[Alecu et al.: Graph functionality, JCTB2021] define functionality, a graph parameter that generalizes graph degeneracy. They research the relation of functionality to many other graph parameters (tree-width, clique-width, VC-dimension, etc.). Extend
Externí odkaz:
http://arxiv.org/abs/2302.11862
Daisies are a special type of hypergraphs introduced by Bollob\'{a}s, Leader and Malvenuto. An $r$-daisy determined by a pair of disjoint sets $K$ and $M$ is the $(r+|K|)$-uniform hypergraph $\{K\cup P:\: P\in M^{(r)}\}$. In [Combin. Probab. Comput.
Externí odkaz:
http://arxiv.org/abs/2211.10377
A natural model of read-once linear branching programs is a branching program where queries are $\mathbb{F}_2$ linear forms, and along each path, the queries are linearly independent. We consider two restrictions of this model, which we call weakly a
Externí odkaz:
http://arxiv.org/abs/2201.10997
Autor:
Pudlák, Pavel
Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good tree codes
Externí odkaz:
http://arxiv.org/abs/2012.03013
Autor:
Pudlák, Pavel
The reflection principle is the statement that if a sentence is provable then it is true. Reflection principles have been studied for first-order theories, but they also play an important role in propositional proof complexity. In this paper we will
Externí odkaz:
http://arxiv.org/abs/2007.14835
Autor:
Pudlak, Pavel
The canonical pair of a proof system $P$ is the pair of disjoint NP sets where one set is the set of all satisfiable CNF formulas and the other is the set of CNF formulas that have $P$-proofs bounded by some polynomial. We give a combinatorial charac
Externí odkaz:
http://arxiv.org/abs/1912.03013
Autor:
Pudlak, M., Nazmitdinov, R. G.
We study various mechanisms of electron transmission across the corrugations in the graphene sheet. The spin dependence of the electron transmission probability in the rippled graphene is found. The electrons mean free path and transmission probabili
Externí odkaz:
http://arxiv.org/abs/1911.07756