Zobrazeno 1 - 10
of 130
pro vyhledávání: '"Galvin, David P."'
Autor:
Galvin, David, Marmorino, Phillip
An $n$-vertex, $d$-regular graph can have at most $2^{n/2+o_d(n)}$ independent sets. In this paper we address what happens with this upper bound when we impose the further condition that the graph has independence number at most $\alpha$. We give upp
Externí odkaz:
http://arxiv.org/abs/2410.19959
Autor:
Galvin, David, Sharpe, Courtney
The independent set sequence of trees has been well studied, with much effort devoted to the (still open) question of Alavi, Malde, Schwenk and Erd\H{o}s on whether the independent set sequence of any tree is unimodal. Much less attention has been gi
Externí odkaz:
http://arxiv.org/abs/2409.15555
Autor:
Galvin, David, Zhang, Yufei
A dominating set in a graph is a set of vertices with the property that every vertex in the graph is either in the set or adjacent to something in the set. The domination sequence of the graph is the sequence whose $k$th term is the number of dominat
Externí odkaz:
http://arxiv.org/abs/2408.12731
In this work, we consider the imaginary time evolution of matrix product states. We present a novel quantum-inspired classical method that, when combined with time evolving block decimation (TEBD), is able to potentially speed-up the convergence to a
Externí odkaz:
http://arxiv.org/abs/2405.04959
Publikováno v:
ANNALES UNIV. SCI. BUDAPEST., SECT. MATH. 65 (2022), 9-30
For integers $r,t\geq2$ and $n\geq1$ let $f_r(t,n)$ be the minimum, over all factorizations of the complete $r$-uniform hypergraph of order $n$ into $t$ factors $H_1,\dots,H_t$, of $\sum_{i=1}^tc(H_i)$ where $c(H_i)$ is the number of maximal cliques
Externí odkaz:
http://arxiv.org/abs/2309.03083
Quantum computing is gaining popularity across a wide range of scientific disciplines due to its potential to solve long-standing computational problems that are considered intractable with classical computers. One promising area where quantum comput
Externí odkaz:
http://arxiv.org/abs/2305.07323
The reciprocal of $e^{-x}$ has a power series about $0$ in which all coefficients are non-negative. Gessel [Reciprocals of exponential polynomials and permutation enumeration, Australas. J. Combin., 74, 2019] considered truncates of the power series
Externí odkaz:
http://arxiv.org/abs/2303.14057
We study the locations of complex zeroes of independence polynomials of bounded degree hypergraphs. For graphs, this is a long-studied subject with applications to statistical physics, algorithms, and combinatorics. Results on zero-free regions for b
Externí odkaz:
http://arxiv.org/abs/2211.00464
Autor:
Galvin, David, Zhang, Yufei
Let ${\bf a}=(a_1, a_2, \ldots, a_n)$ and ${\bf e}=(e_1, e_2, \ldots, e_n)$ be real sequences. Denote by $M_{{\bf e}\rightarrow {\bf a}}$ the $(n+1)\times(n+1)$ matrix whose $(m,k)$ entry ($m, k \in \{0,\ldots, n\}$) is the coefficient of the polynom
Externí odkaz:
http://arxiv.org/abs/2208.12375
Autor:
Basit, Abdul, Galvin, David
A celebrated conjecture of Tuza states that in any finite graph the minimum size of a cover of triangles by edges is at most twice the maximum size of a set of edge-disjoint triangles. For an $r$-uniform hypergraph ($r$-graph) $G$, let $\tau(G)$ be t
Externí odkaz:
http://arxiv.org/abs/2204.04568