Related papers: Determinants, Choices and Combinatorics
We study multi-variable integrals, that we name Sklyanin-Whittaker integrals, and prove their determinantal formulas. We also discuss a $q$-deformation, a determinantal point process, and associated Mellin--Barnes integrals.
We give one more proof of the fact that symplectic matrices over real and complex fields have determinant one. While this has already been proved many times, there has been lasting interest in finding an elementary proof. Our result is…
In 1989, Rota conjectured that, given $n$ bases $B_1,\dots,B_n$ of the vector space $\mathbb{F}^n$ over some field $\mathbb{F}$, one can always decompose the multi-set $B_1\cup \dots \cup B_n$ into transversal bases. This conjecture remains…
In this note we generalize the convolution formula for the Tutte polynomial of Kook-Reiner-Stanton and Etienne-Las Vergnas to a more general setting that includes both arithmetic matroids and delta-matroids. As corollaries, we obtain new…
We prove a conjectured relationship among resultants and the determinants arising in the formulation of the method of moving surfaces for computing the implicit equation of rational surfaces formulated by Sederberg. In addition, we extend…
We prove decidability of univariate real algebra extended with predicates for rational and integer powers, i.e., $(x^n \in \mathbb{Q})$ and $(x^n \in \mathbb{Z})$. Our decision procedure combines computation over real algebraic cells with…
In this paper we deal with the noteworthy Sylvester's determinantal identity and some of its generalizations. We report the formulae due to Yakovlev, to Gasca, Lopez--Carmona, Ramirez, to Beckermann, Gasca, M\"uhlbach, and to Mulders in a…
We obtain a combinatorial formula for the Miller-Morita-Mumford classes for the mapping class group of punctured surfaces and prove Witten's conjecture that they are proportional to the dual to the Witten cycles. The proportionality…
There are two well known tasks, related to Newton polyhedra: to study invariants of singularities in terms of their Newton polyhedra, and to describe Newton polyhedra of resultants and discriminants. We introduce so called resultantal…
Let $C(n,p)$ be the set of $p$-compositions of an integer $n$, i.e., the set of $p$-tuples $\bm{\alpha}=(\alpha_1,...,\alpha_p)$ of nonnegative integers such that $\alpha_1+...+\alpha_p=n$, and $\mathbf{x}=(x_1,...,x_p)$ a vector of…
The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…
Recently there has been several works estimating the number of $n\times n$ matrices with elements from some finite sets $\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial…
Determinant formulas for the general solutions of the Toda and discrete Toda equations are presented. Application to the $\tau$ functions for the Painlev\'e equations is also discussed.
We define an inference system to capture explanations based on causal statements, using an ontology in the form of an IS-A hierarchy. We first introduce a simple logical language which makes it possible to express that a fact causes another…
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
We prove effective versions of Oppenheim's conjecture for generic inhomogeneous forms in the S-arithmetic setting. We prove an effective result for fixed rational shifts and generic forms and we also prove a result where both the quadratic…
Let A be a class of objects, equipped with an integer size such that for all n the number a(n) of objects of size n is finite. We are interested in the case where the generating fucntion sum_n a(n) t^n is rational, or more generally…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
For any $m,n\in\mathbb{N}$ we first give new proofs for the following well known combinatorial identities \begin{equation*} S_n(m)=\sum\limits_{k=1}^n\binom{n}{k}\frac{(-1)^{k-1}}{k^m}=\sum\limits_{n\geq r_1\geq r_2\geq...\geq r_m\geq…
In this note we introduce a determinant and then give its evaluating formula. The determinant turns out to be a generalization of the well-known ballot and Fuss-Catalan numbers, which is believed to be new. The evaluating formula is proved…