Related papers: Determinants, Choices and Combinatorics
We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…
We review the connections between the octahedral recurrence, $\lambda$-determinants and tiling problems. This provides in particular a direct combinatorial interpretation of the $\lambda$-determinant (and generalizations thereof) of an…
Iterating Newton's method symbolically for the general quadratic yields a rational function, the numerator and denominator of which are polynomials with highly composite coefficients.
This article describes a sequence of rational functions which converges locally uniformly to the zeta function. The numerators (and denominators) of these rational functions can be expressed as characteristic polynomials of matrices that…
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…
Automated predictions require explanations to be interpretable by humans. One type of explanation is a rationale, i.e., a selection of input features such as relevant text snippets from which the model computes the outcome. However, a…
We study the Fox coloring invariants of rational knots. We express the propagation of the colors down the twists of these knots and ultimately the determinant of them with the help of finite increasing sequences whose terms of even order…
K\"ulshammer, Olsson, and Robinson developed an l-analogue of modular representation theory of symmetric groups where l is not necessarily a prime. They gave a conjectural combinatorial description for invariant factors of the Cartan matrix…
Based on a less-known result, we prove a recent conjecture concerning the determinant of a certain Sylvester-Kac type matrix and consider an extension of it.
We prove a conjecture of Shklyarov concerning the relationship between K. Saito's higher residue pairing and a certain pairing on the periodic cyclic homology of matrix factorization categories. Along the way, we give new proofs of a result…
Horn's conjecture, which given the spectra of two Hermitian matrices describes the possible spectra of the sum, was recently settled in the affirmative. In this survey we discuss one of the many steps in this, which required us to introduce…
We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.
In this paper we formulate two generalizations of Agoh's conjecture. We also formulate conjectures involving congruence modulo primes about hyperbolic secant, hyperbolic tangent, N\"orlund numbers, as well as about coefficients of…
A theorem of Mina evaluates the determinant of a matrix with entries $D^j(f(x)^i)$. We note the important special case where the matrix entries are evaluated at $x=0$ and give a simple proof of it, and some applications. We then give a…
The paper focuses on some versions of connected dominating set problems: basic problems and multicriteria problems. A literature survey on basic problem formulations and solving approaches is presented. The basic connected dominating set…
We introduce a combinatorial criterion for verifying whether a formula is not the conjunction of an equation and a co-equation. Using this, we give a proof for the nonequationality of the free group. Furthermore, we generalize the latter…
A fundamental question in logic and verification is the following: for which unary predicates $P_1, \ldots, P_k$ is the monadic second-order theory of $\langle \mathbb{N}; <, P_1, \ldots, P_k \rangle$ decidable? Equivalently, for which…
We compute the spectrum and Smith normal form of the incidence matrix of disjoint transversals, a combinatorial object closely related to the n-dimensional case of Rota's basis conjecture.
Let $r$ be any positive integer, and let $x_1, x_2$ be indeterminates. We consider the sequence $\{x_n\}$ defined by the recursive relation $$ x_{n+1} =(x_n^r +1)/{x_{n-1}} $$ for any integer $n$. Finding a combinatorial expression for…
We present a direct proof of the second conjecture made by M. Atiyah and P. Sutcliffe for the case of convex quadrilaterals. Unlike previous work on this conjecture, our proof does not require any computer aided computations. The new proof…