Related papers: Computing Volumes of Adjacency Polytopes via Draco…
A generalised quasilinear (GQL) approximation (Marston \emph{et al.}, \emph{Phys. Rev. Lett.}, vol. 116, 104502, 2016) is applied to turbulent channel flow at $Re_\tau \simeq 1700$ ($Re_\tau$ is the friction Reynolds number), with emphasis…
Graph states are fundamental objects in the theory of quantum information due to their simple classical description and rich entanglement structure. They are also intimately related to IQP circuits, which have applications in quantum…
An outline is given of an extended perturbative solution of Euclidean QCD which systematically accounts for a class of nonperturbative effects, while allowing renormalization by the perturbative counterterms. Proper vertices Gamma are…
A widely studied non-deterministic polynomial time (NP) hard problem lies in finding a route between the two nodes of a graph. Often meta-heuristics algorithms such as $A^{*}$ are employed on graphs with a large number of nodes. Here, we…
Let $(P,\leq_P)$ and $(Q,\leq_Q)$ be finite partially ordered sets with $|P|=|Q|=d$, and $\mathcal{C}(P) \subset \mathbb{R}^d$ and $\mathcal{C}(Q) \subset \mathbb{R}^d$ their chain polytopes. The twinned chain polytope of $P$ and $Q$ is the…
We consider two types of joins of graphs $G_{1}$ and $G_{2}$, $G_{1}\veebar G_{2}$ - the Neighbors Splitting Join and $G_{1}\underset{=}{\lor}G_{2}$ - the Non Neighbors Splitting Join, and compute the adjacency characteristic polynomial,…
We list the so-called Askey-scheme of hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation and generating functions of all classes of orthogonal…
The vast corpus of physics equations forms an implicit network of mathematical relationships that traditional analysis cannot fully explore. This work introduces a graph-based framework combining neural networks with symbolic analysis to…
As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…
For a graph $G$, the generalized adjacency matrix $A_\alpha(G)$ is the convex combination of the diagonal matrix $D(G)$ and the adjacency matrix $A(G)$ and is defined as $A_\alpha(G)=\alpha D(G)+(1-\alpha) A(G)$ for $0\leq \alpha \leq 1$.…
We introduce boundary quotients and present a framework for learning densities on manifolds that arise as boundary quotients of simpler domains. We show that this framework can be used to construct normalizing flows on quotient manifolds…
Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…
Natural question generation (QG) aims to generate questions from a passage and an answer. Previous works on QG either (i) ignore the rich structure information hidden in text, (ii) solely rely on cross-entropy loss that leads to issues like…
For a connected weighted hypergraph, we give a randomized almost-linear-time solver for the Poisson problem for the cut-based hypergraph Laplacian in the natural input size $P=\sum_{e\in E}|e|$, the sum of hyperedge sizes. For every fixed…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
We obtain new explicit formulas for the recurrence coefficients of the q-orthogonal polynomial sequences in a class that extends the q-Askey scheme. Our formulas express the recurrence coefficients in terms of four parameters that determine…
We estimate the minimum number of distance queries that is sufficient to reconstruct the binomial random graph $G(n,p)$ with constant diameter with high probability. We get a tight (up to a constant factor) answer for all $p>n^{-1+o(1)}$…
In this paper, we consider the volume of a special kind of flow polytope. We show that its volume satisfies a certain system of differential equations, and conversely, the solution of the system of differential equations is unique up to a…
Complex networks have acquired a great popularity in recent years, since the graph representation of many natural, social and technological systems is often very helpful to characterize and model their phenomenology. Additionally, the…
Boltzmann-Gibbs statistical mechanics applies satisfactorily to a plethora of systems. It fails however for complex systems generically involving strong space-time entanglement. Its generalization based on nonadditive $q$-entropies…