Related papers: Regularity and counting lemmas for multidimensiona…
We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…
A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…
A general method for calculating asymptotic expansions of infinite sums in thermal field theory is presented. It is shown that the Mellin summation method works elegantly with dimensional regularization. A general result is derived for a…
A new Dimensional Regularization of $\gamma_5$ is proposed. Cyclicity and Lorentz covariance are enforced. The extension to generic dimension is based on the integral representation of the trace of gamma's, presented in a previous paper.
The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. By Minc's conjecture, there exists a reachable upper bound on the permanent of 2-dimensional (0,1)-matrices. In this paper we obtain some…
Dimensional regularization of Euclidean momentum space integrals is a highly successful technique in renormalization of quantum field theories. While it yields a straightforward algorithmic method, with which to evaluate diagrams beyond…
An extension of dimensional regularization to the case of compact dimensions is presented. The procedure preserves the Kaluza-Klein tower structure, but has a regulator specific to the compact dimension. Possible 5 and 4 dimensional…
A method for compression of large graphs and non-negative matrices to a block structure is proposed. Szemer\'edi's regularity lemma is used as heuristic motivation of the significance of stochastic block models. Another ingredient of the…
Calculation of the log-normalizer is a major computational obstacle in applications of log-linear models with large output spaces. The problem of fast normalizer computation has therefore attracted significant attention in the theoretical…
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
The aim of this paper is to numerically study the performance of a method of regularization. This technique was developed to solve the illposed problem of estimating a source-dimensional Poisson equation for two dimensions from measurements…
This work is concerned with regular languages defined over large alphabets, either infinite or just too large to be expressed enumeratively. We define a generic model where transitions are labeled by elements of a finite partition of the…
In this paper, we give an elementary proof of the additivity of the functional inverses of the resolvents of large $N$ random matrices, using recently developed matrix model techniques. This proof also gives a very natural generalization of…
In this paper, we propose a coupled tensor norm regularization that could enable the model output feature and the data input to lie in a low-dimensional manifold, which helps us to reduce overfitting. We show this regularization term is…
A generalized definition of the determinant of matrices is given, which is compatible with the usual determinant for square matrices and keeps many important properties, such as being an alternating multilinear function, keeping…
In this short note we prove a lemma about the dimension of certain algebraic sets of matrices. This result is needed in our paper arXiv:1201.1672. The result presented here has also applications in other situations and so it should appear…
Given a primitive collection of vectors in the integer lattice, we count the number of ways it can be extended to a basis by vectors with sup-norm bounded by $T$, producing an asymptotic estimate as $T \to \infty$. This problem can be…
In this article, we use $\lambda$-sequences to derive common fixed points for a family of self-mappings defined on a complete $G$-metric space. We imitate some existing techniques in our proofs and show that the tools emlyed can be used at…