相关论文: The bricklayer problem and the Strong Cycle Lemma

We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial developments relating classical planar graph counting problems to…

In the weakened 16th Hilbert's Problem one asks for a bound of the number of limit cycles which appear after a polynomial perturbation of a planar polynomial Hamiltonian vector field. It is known that this number is finite for an individual…

We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…

We describe a framework for reformulating and solving optimization problems that generalizes the well-known framework originally introduced by Benders. We discuss details of the application of the procedures to several classes of…

The paper proposes a logical model of combinatorial problems, also it gives an example of a problem of the class NP that can not be solved in polynomial time on the dimension of the problem.

This paper examines the problem of learning with a finite and possibly large set of p base kernels. It presents a theoretical and empirical analysis of an approach addressing this problem based on ensembles of kernel predictors. This…

While large language models (LLMs) have shown strong performance in math and logic reasoning, their ability to handle combinatorial optimization (CO) -- searching high-dimensional solution spaces under hard constraints -- remains…

We explain how the moments of the (weight function of the) Askey Wilson polynomials are related to the enumeration of the staircase tableaux introduced by the first and fourth authors. This gives us a direct combinatorial formula for these…

This paper is devoted to a fundamental system of equations in Linear Elasticity Theory: the famous Lam\'e-Navier system. The Clifford algebra language allows us to rewrite this system in terms of the euclidean Dirac operator, which at the…

We consider a long but finite (ladder) circuit with alternating connections of resistors in series and parallel and derive an explicit expression for its equivalent resistance as a function of the number of repeating blocks, $R_{\rm…

This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…

We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these…

In problem solving, understanding the problem that one seeks to solve is an essential initial step. In this paper, we propose computational methods for facilitating problem understanding through the task of recognizing the unknown in…

During the last years the authors have studied the number of limit cycles of several families of planar vector fields. The common tool has been the use of an extended version of the celebrated Bendixson-Dulac Theorem. The aim of this work…

When a problem has more than one solution, it is often important, depending on the underlying context, to enumerate (i.e., to list) them all. Even when the enumeration can be done in polynomial delay, that is, spending no more than…

We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…

We consider the problem Scattered Cycles which, given a graph $G$ and two positive integers $r$ and $\ell$, asks whether $G$ contains a collection of $r$ cycles that are pairwise at distance at least $\ell$. This problem generalizes the…

Many industrial applications require finding solutions to challenging combinatorial problems. Efficient elimination of symmetric solution candidates is one of the key enablers for high-performance solving. However, existing model-based…

Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of…

We introduce a new variety of set-theoretic non-associative algebras, P{\l}onka bi-magmas, to describe and classify all solutions of the set-theoretic Yang-Baxter (YB) equation of Baaj-Long-Skandalis (BLS) type. We also study new classes of…