Related papers: Short Proofs in Algebraic and Enumerative Combinat…

In this note we settle two open problems in the theory of permanents by using recent results from other areas of mathematics. Bapat conjectured that certain quotients of permanents, which generalize symmetric function means, are concave. We…

In a recent preprint, Gullerud and Walker [2] proved a theorem and made a conjecture about the correctness of efficiently generating B\'ezout trees for Pythagorean pairs. In this note, we give a simple proof of their theorem, confirm that…

This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…

This short expository note gives an elementary introduction to the study of dynamics on certain moduli spaces, and in particular the recent breakthrough result of Eskin, Mirzakhani, and Mohammadi. We also discuss the context and…

When improving results about generalized inverses, the aim often is to do this in the most general setting possible by eliminating superfluous assumptions and by simplifying some of the conditions in statements. In this paper, we use…

We study short sums of algebraic trace functions via the $q$-analogue of van der Corput method, and develop methods of arithmetic exponent pairs that coincide with the classical case while the moduli has sufficiently good factorizations. As…

In connection to a conjecture of W. L\"u. Q. Li and C. Yang we prove a result on small function sharing by a power of a meromorphic function with few poles and its derivative. Our results improve a number of known results.

This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…

The alternating sign matrices-descending plane partitions (ASM-DPP) bijection problem is one of the most intriguing open problems in bijective combinatorics, which is also relevant to integrable combinatorics. The notion of a signed set and…

We consider three problems from the recent issues of the American Mathematical Monthly involving different versions of Catalan triangle. Our main results offer generalizations of these identities and demonstrate automated proofs with…

Motivated by a historical combinatorial problem that resembles the well-known Josephus problem, we investigate circular partition algorithms and formulate problems in deterministic finite automata with practical algorithms. The historical…

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

In this paper we prove the validity of Gibbons' conjecture for a coupled competing Gross-Pitaevskii system. We also provide sharp a priori bounds, regularity results and additional Liouville-type theorems.

In this note, we use the concept of a polynomial ring to give an elementary proof to Cayley-Hamilton Theorem. We also give an elementary proof to Birkhoff theorem on Bi-stochastic matrices.

In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding)…

We give a new proof of a theorem of Mints that the positive fragment of minimal predicate logic is decidable. The idea of the proof is to replace the eigenvariable condition of sequent calculus by an appropriate scoping mechanism. The…

Additive combinatorics asks for lower bounds on sumsets and restricted sumsets over finite fields. Central examples are the Cauchy-Davenport theorem and the Erd\H{o}s-Heilbronn conjecture. In this note, we develop Das's linear algebraic…

In 2015, the author proved combinatorially character formulas expressing sums of the (formal) dimensions of irreducible representations of symplectic groups, refining some works of Nekrasov and Okounkov, Han, King, and Westbury. In this…

In this brief note, we show that the hypotheses of L\"owner's theorem on matrix monotonicity in several commuting variables as proved by Agler, McCarthy and Young can be significantly relaxed. Specifically, we extend their theorem from…

This is an introduction to algebraic combinatorics, written for a quarter-long graduate course. It starts with a rigorous introduction to formal power series with some combinatorial applications, then discusses integer partitions (proving…