Related papers: The strong approximation theorem and computing wit…
We show that Wilson's theorem as well as the Wilson quotient can be described by supercongruences modulo any higher prime power involving terms of power sums of Fermat quotients. The new approach uses Bell polynomials and Newton's…
Given any pair of positive integers m and n, we construct a new Hopf algebra, which may be regarded as a degenerate version of the quantum group of gl(m+n). We study its structure and develop a highest weight representation theory. The…
We present a scheme for investigating arbitrary thermal observables in spatially inhomogeneous equilibrium many-body systems. Extending the grand canonical ensemble yields any given observable as an explicit hyper-density functional.…
We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…
Special orthogonal matrices with rational elements form the group SO(n,Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for…
We answer the question asked by Louder, McReynolds and Patel, and prove the following statement. Let L be a RAAG, H a word quasiconvex subgroup of L, then there is a finite dimensional representation of L that separates the subgroup H in…
Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. Surprisingly, this problem has received little attention in…
We prove matching direct and inverse theorems for uniform polynomial approximation with $A^*$ weights (a subclass of doubling weights suitable for approximation in the $L_\infty$ norm) having finitely many zeros and not too "rapidly…
We use deep sparsely connected neural networks to measure the complexity of a function class in $L^2(\mathbb R^d)$ by restricting connectivity and memory requirement for storing the neural networks. We also introduce representation system -…
We study the general problem of extremality for metric Diophantine approximation on submanifolds of matrices. We formulate a criterion for extremality in terms of a certain family of algebraic obstructions and show that it is sharp. In…
We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…
Is there any theoretical guarantee for the approximation ability of neural networks? The answer to this question is the "Universal Approximation Theorem for Neural Networks". This theorem states that a neural network is dense in a certain…
Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable…
We give a complete classification of finitely generated virtually free groups up to $\forall\exists$-elementary equivalence. As a corollary, we give an algorithm that takes as input two finite presentations of virtually free groups, and…
Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…
Let $G$ be a simple algebraic group over an algebraically closed field and let $X$ be an irreducible subvariety of $G^r$ with $r \geqslant 2$. In this paper, we consider the general problem of determining if there exists a tuple $(x_1,…
We show that for any uniformly parabolic fully nonlinear second-order equation with bounded measurable "coefficients" and bounded "free" term in the whole space or in any cylindrical smooth domain with smooth boundary data one can find an…
Previous formulations of group theory in ACL2 and Nqthm, based on either "encapsulate" or "defn-sk", have been limited by their failure to provide a path to proof by induction on the order of a group, which is required for most interesting…
In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…
Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…