Related papers: A combinatorial determinant
This article is an introduction to combinatorics under the axiom of determinacy with a focus on partition properties and infinity Borel codes.
We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…
In this paper we generalize a shift theorem, which plays a key role in studying representations of FI$^m$, the product category of the category of finite sets and injections, and classify finitely generated injective FI$^m$-modules over a…
The aim of this paper is to show an estimate for the determinant of the covariance of a two-dimensional vector of multiple stochastic integrals of the same order in terms of a linear combination of the expectation of the determinant of its…
A partition is finitary if all its members are finite. For a set $A$, $\mathscr{B}(A)$ denotes the set of all finitary partitions of $A$. It is shown consistent with $\mathsf{ZF}$ (without the axiom of choice) that there exist an infinite…
Let $\Delta(n)$ denote the smallest positive integer $m$ such that $a^3+a(1\le a\le n)$ are pairwise distinct modulo $m$. The purpose of this paper is to determine $\Delta(n)$ for all positive integers $n$.
We provide a general theoretical framework to derive Bernstein-von Mises theorems for matrix functionals. The conditions on functionals and priors are explicit and easy to check. Results are obtained for various functionals including…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
In this paper, we present a simplified proof of Rado's Theorem and demonstrate that when an integer matrix $M$ satisfies the column condition and $M\mathbf x=\mathbf 0$ has an element-distinct solution on $\mathbb N$, then under any finite…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
When the classical Hamburger moment problem has solutions, it has either exactly one solution or infinitely many solutions. Correspondingly, the moment problem is said to be either determinate or indeterminate. In terms of Jacobi operators,…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
Disjunctive Linear Arithmetic (DLA) is a major decidable theory that is supported by almost all existing theorem provers. The theory consists of Boolean combinations of predicates of the form $\Sigma_{j=1}^{n}a_j\cdot x_j \le b$, where the…
This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…
We prove a conjecture by D. Zeilberger on the determinant of a certain matrix and relate it to a problem of non-existence of 1-cycles in this note.
The theory of matrix models is reviewed from the point of view of its relation to integrable hierarchies. Determinantal formulas, relation to conformal field models and the theory of Generalized Kontsevich model are discussed in some…
The aim of this paper is to establish some metrical coincidence and common fixed point theorems with an arbitrary relation under an implicit contractive condition which is general enough to cover a multitude of well known contraction…
A new criterion is developed which provides a check as to whether a chosen set of polarization observables is complete with respect to the determination of all independent $T$-matrix elements of a reaction of the type $a+b\to c+d+...$. As…
Using an adaptation of Qin Jiushao's method from the 13th century, it is possible to prove that a system of linear modular equations a(i,1) x(i) + ... + a(i,n) x(n) = b(i) mod m(i), i=1, ..., n has integer solutions if m(i)>1 are pairwise…