相关论文: Minimal bad sequences are necessary for a uniform …
Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1's on each row are consecutive. A Minimal Conflicting Set is a set of rows that does not have the C1P, but every proper subset has…
We describe a novel framework for partially quenched chiral perturbation theory based on the replica method. The computational rules are exceedingly simple. We illustrate these rules by computing the partially quenched chiral condensate to…
Minwise hashing (MinHash) is an important and practical algorithm for generating random hashes to approximate the Jaccard (resemblance) similarity in massive binary (0/1) data. The basic theory of MinHash requires applying hundreds or even…
The Carlson-Simpson lemma is a combinatorial statement occurring in the proof of the Dual Ramsey theorem. Formulated in terms of variable words, it informally asserts that given any finite coloring of the strings, there is an infinite…
Sequence comparison is a prerequisite to virtually all comparative genomic analyses. It is often realized by sequence alignment techniques, which are computationally expensive. This has led to increased research into alignment-free…
Contrastive learning is an efficient approach to self-supervised representation learning. Although recent studies have made progress in the theoretical understanding of contrastive learning, the investigation of how to characterize the…
Consider a regression problem where the learner is given a large collection of $d$-dimensional data points, but can only query a small subset of the real-valued labels. How many queries are needed to obtain a $1+\epsilon$ relative error…
We provide a mathematical definition of a low energy scaling limit of a sequence of general non-relativistic quantum theories in any dimension, and apply our formalism to anyonic chains. We formulate Conjecture 4.3 on conditions when a…
Gottesman-Knill theorem states that computations on stabilizer circuits can be simulated on a classical computer, conventional simulation algorithms extensively use linear algebra over bit strings. For instance, given a non-adaptive…
Causal discovery, the problem of inferring the direction of causality, is generally ill-posed. We use the language of structural causal models (SCM) to show that assuming that the causal relations are acyclic and invariant across multiple…
The main results of this paper (a) extend the finite Ramsey partition theorem, and (b) employ this extension to obtain a stronger form of the infinite Nash-Williams partition theorem, and also a new proof of Ellentuck's, and hence…
The von Neumann entropy of an $n$-partite system $A_1^n$ given a system $B$ can be written as the sum of the von Neumann entropies of the individual subsystems $A_k$ given $A_1^{k-1}$ and $B$. While it is known that such a chain rule does…
Recently Alan D. Sokal gave a very short and completely elementary proof of the uniform boundedness principle. The aim of this note is to point out that by using a similiar technique one can give a considerably short and simple proof of a…
The minimum classical extension S$^{+g}$ of a classically sound theory S based on intuitionistic logic, defined by adding to S the Gentzen negative interpretations of its mathematical axioms, contains a faithful translation S$^g$ of the…
The purpose of this paper is to establish a Nadel vanishing theorem for big line bundles with multiplier ideal sheaves of singular metrics admitting an analytic Zariski decomposition (such as, metrics with minimal singularities and Siu's…
Ordered sequences of univariate or multivariate regressions provide statistical models for analysing data from randomized, possibly sequential interventions, from cohort or multi-wave panel studies, but also from cross-sectional or…
We show that over the weak base theory $\mathrm{RCA}_0^*$, cohesive Ramsey's theorem for pairs $\mathrm{CRT}^2_2$ implies exponential closure of the definable cut $\mathrm{I}^0_1$, which is the intersection of all $\Sigma^0_1$-definable…
A combinatorial principle CECA is formulated and its equivalence with GCH+ certain weakenings of Box_lambda for singular lambda is proved. CECA is used to show that certain ``almost point- < tau'' families can be refined to point- < tau…
In this paper, a temporal nonuniform $L1$ type difference scheme is built up for the time fractional diffusion-wave equation with the help of the order reduction technique. The unconditional convergence of the nonuniform difference scheme…