相关论文: Root system chip-firing I: Interval-firing

The mixed spin-(1/2,1) Ising chain with axial and rhombic zero-field splitting parameters in a presence of the longitudinal magnetic field is exactly solved within the framework of decoration-iteration transformation and transfer-matrix…

Automated theorem proving in first-order logic is an active research area which is successfully supported by machine learning. While there have been various proposals for encoding logical formulas into numerical vectors -- from simple…

Let $p \geq 2$ be a large prime, and let $k \ll \log p $ be a small integer. This note proves the existence of various configurations of $(k+1)$-tuples of consecutive and quasi consecutive primitive roots $n+a_0, n+a_1, n+a_2, \ldots,…

We introduce the \emph{temporal graphlet kernel} for classifying dissemination processes in labeled temporal graphs. Such dissemination processes can be spreading (fake) news, infectious diseases, or computer viruses in dynamic networks.…

Prompting methods recently achieve impressive success in few-shot learning. These methods modify input samples with prompt sentence pieces, and decode label tokens to map samples to corresponding labels. However, such a paradigm is very…

Several conditions are known for a self-inversive polynomial that ascertain the location of its roots, and we present a framework for comparison of those conditions. We associate a parametric family of polynomials $p_\alpha$ to each such…

The idea that the cohomology of finite groups might be fruitfully approached via the cohomology of ambient semisimple algebraic groups was first shown to be viable in the papers [CPS75] and [CPSvdK77]. The second paper introduced, through a…

Lockstep processing is a recognized technique for helping to secure functional-safety relevant processing against, for instance, single upset errors that might cause faulty execution of code. Lockstepping processors does however bind…

We propose a method for inferring \emph{parameterized regular types} for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint systems). Such parameterized regular types generalize…

We investigate the mechanisms of self-distillation in multi-class classification, particularly in the context of linear probing with fixed feature extractors where traditional feature learning explanations do not apply. Our theoretical…

We introduce a class of random graph processes, which we call flip processes. Each such process is given by a rule which is a function $\mathcal{R}:\mathcal{H}_k\rightarrow \mathcal{H}_k$ from all labeled $k$-vertex graphs into itself ($k$…

Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any…

A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show that a deterministic black-box identity testing algorithm for…

We introduce a symmetric tridiagonal matrix-valued process ($\beta$-TMP) $H(t)$ whose diagonal entries $H_{k,k}(t)$ evolve independently via an Ornstein-Uhlenbeck process starting at the origin and the off-diagonal entries $H_{k,k+1}(t)$…

Linear algebra expressions, which play a central role in countless scientific computations, are often computed via a sequence of calls to existing libraries of building blocks (such as those provided by BLAS and LAPACK). A sequence…

We introduce a reversible Markovian coagulation-fragmentation process on the set of partitions of $\{1,\ldots,L\}$ into disjoint intervals. Each interval can either split or merge with one of its two neighbors. The invariant measure can be…

We study chip-firing on a signed graph $G_\phi$, employing a general theory of chip-firing on invertible matrices introduced by Guzm\'an and Klivans. Here a negative edge designates an adversarial relationship, so that firing a vertex…

We present a simple, work-optimal and synchronization-free solution to the problem of stably merging in parallel two given, ordered arrays of m and n elements into an ordered array of m+n elements. The main contribution is a new, simple,…

Linear autoregressive models serve as basic representations of discrete time stochastic processes. Different attempts have been made to provide non-linear versions of the basic autoregressive process, including different versions based on…

Multiphase ranking functions ($\mathit{M{\Phi}RFs}$) were proposed as a means to prove the termination of a loop in which the computation progresses through a number of "phases", and the progress of each phase is described by a different…