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

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…

We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly simple combination of Lambek's and the proof…

We address a systematic combinatorial approach to the anti-normal ordering problem. In this way, we use the Stirling numbers and their generating function, the so-called Bell polynomials, together with the operational methods to anti-normal…

Let k be an algebraically closed field of characteristic p>0. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the general linear group over k in terms of cap diagrams under…

Symmetry is an important problem in many combinatorial problems. One way of dealing with symmetry is to add constraints that eliminate symmetric solutions. We survey recent results in this area, focusing especially on two common and useful…

We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…

In this paper, we propose to enumerate all different configurations belonging to a specific class of fractals: A binary initial tile is selected and a finite recursive tiling process is engaged to produce auto-similar binary patterns. For…

Weighted bipolar argumentation frameworks allow modeling decision problems and online discussions by defining arguments and their relationships. The strength of arguments can be computed based on an initial weight and the strength of…

We prove a lemma, which we call the Order Ideal Lemma, that can be used to demonstrate a wide array of log-concavity and log-convexity results in a combinatorial manner using order ideals in distributive lattices. We use the Order Ideal…

In this paper, we present several novel integral representations of Catalan's constant. We begin by deriving an initial result expressed as a double integral. Subsequently, as a consequence of this result, we establish a general theorem…

We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

Large language models (LLMs) often struggle with complex logical reasoning due to logical inconsistencies and the inherent difficulty of such reasoning. We use Lean, a theorem proving framework, to address these challenges. By formalizing…

Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is…

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

We present the library Collier for the numerical evaluation of one-loop scalar and tensor integrals in perturbative relativistic quantum field theories. The code provides numerical results for arbitrary tensor and scalar integrals for…

We announce a series of results on the combinatorial study of the q-Catalan triangle (C_{n,k}(q)), defined by C_{n,0}(q)=q^{n(n-1)/2} and C_{n,k}(q)=C_{n,k-1}(q)+q^{n-k-1}C_{n-1,k}(q). We establish combinatorial interpretations via a…

Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, the tools provided by complexity theory for this important…

We extend the original cylinder conjecture on point sets in affine three-dimensional space to the more general framework of divisible linear codes over $\mathbb{F}_q$ and their classification. Through a mix of linear programming,…

Efficient omission of symmetric solution candidates is essential for combinatorial problem-solving. Most of the existing approaches are instance-specific and focus on the automatic computation of Symmetry Breaking Constraints (SBCs) for…

We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these…