相关论文: Root system chip-firing II: Central-firing
We study systems of combinatorial Dyson-Schwinger equations with an arbitrary number $N$ of coupling constants. The considered Hopf algebra of Feynman graphs is $\mathbb{N}^N$-graded, and we wonder if the graded subalgebra generated by the…
The Feigin--Frenkel theorem states that, over the complex numbers, the centre of the universal affine vertex algebra at the critical level is an infinite rank polynomial algebra. The first author and W.~Wang observed that in positive…
It remains an open problem if there are universal scaling functions across a topological quantum phase transition (TPT) without an order parameter, but with extended Fermi surfaces (FS ). Here, we study a simple system of fermions hopping…
We introduce $\mathcal{B}_{\kappa}$-embeddings, nonlinear mathematical structures that connect, through smooth paths parameterized by $\kappa$, a finite or denumerable set of objects at $\kappa=0$ (e.g. numbers, functions, vectors,…
A middle-cube is an induced subgraph consisting of nodes at the middle two layers of a hypercube. The middle-cubes are related to the well-known Revolving Door (Middle Levels) conjecture. We study the middle-cube graph by completely…
For any root system and any commutative ring we give a relatively simple presentation of a group related to its Steinberg group St. This includes the case of infinite root systems used in Kac-Moody theory, for which the Steinberg group was…
In typical non-idempotent intersection type systems, proof normalization is not confluent. In this paper we introduce a confluent non-idempotent intersection type system for the lambda-calculus. Typing derivations are presented using proof…
We present a logical system CFP (Concurrent Fixed Point Logic) from whose proofs one can extract nondeterministic and concurrent programs that are provably total and correct with respect to the proven formula. CFP is an intuitionistic…
We investigate the charge fluctuations of a grain (large dot) coupled to a lead via a small quantum dot in the Kondo regime. We show that the strong entanglement of charge and spin flips in this setup can result in a stable SU(4) Kondo…
For an $n$-vertex graph $G$, let $z(G;k)$ denote the number of zero forcing sets of size $k$. A conjecture of Boyer et al. asserts that the path $P_n$ maximizes these numbers coefficientwise among all $n$-vertex graphs; equivalently, the…
In the \emph{graph matching} problem we observe two graphs $G,H$ and the goal is to find an assignment (or matching) between their vertices such that some measure of edge agreement is maximized. We assume in this work that the observed pair…
It is shown that when the gauge algebra is with root system the canonical Hamiltonian commutes with the constraints. Two other simple propositions concerning gauge fixing are proved too.
Traditionally one and two-point correlation functions are used to characterize many-body systems. In strongly correlated quantum materials, such as the doped 2D Fermi-Hubbard system, these may no longer be sufficient because higher-order…
Link prediction in a graph is the problem of detecting the missing links that would be formed in the near future. Using a graph representation of the data, we can convert the problem of classification to the problem of link prediction which…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
Label spreading is a general technique for semi-supervised learning with point cloud or network data, which can be interpreted as a diffusion of labels on a graph. While there are many variants of label spreading, nearly all of them are…
We summarize recent work on the classification of modular invariant partition functions that can be obtained with simple currents in theories with a center (Z_p)^k with p prime. New empirical results for other centers are also presented.…
This paper is devoted to deriving the first circumcenter iteration scheme that does not employ a product space reformulation for finding a point in the intersection of two closed convex sets. We introduce a so-called centralized version of…
Aval et al. proved that starting from a critical configuration of a chip- firing game on an undirected graph, one can never achieve a stable configuration by reverse firing any non-empty subsets of its vertices. In this paper, we generalize…
We prove the arithmetic fundamental lemma conjecture over a general $p$-adic field with odd residue cardinality $q\geq \dim V$. Our strategy is similar to the one used by the second author during his proof of the AFL over $\mathbb{Q}_p$…