Related papers: Laver tables and combinatorics
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…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
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…
The critical point between varieties A and B of algebras is defined as the least cardinality of the semilattice of compact congruences of a member of A but of no member of B, if it exists. The study of critical points gives rise to a whole…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including…
We discuss various old and new definitions of the notion of a vector field on a convenient manifold that can be proved to give rise to Lie algebras, and are in finite dimensions equivalent to the standard notion of a vector field.
We try to bring to light some combinatorial structure underlying formal proofs in logic. We do this through the study of the Craig Interpolation Theorem which is properly a statement about the structure of formal derivations. We show that…
To build a large library of mathematics, it seems more efficient to take advantage of the inherent structure of mathematical theories. Various theory presentation combinators have been proposed, and some have been implemented, in both…
A combinatorial description of the crystal $\mathcal{B}(\infty)$ for finite-dimensional simple Lie algebras in terms of Young tableaux was developed by J. Hong and H. Lee. Using this description, we obtain a combinatorial rule for…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
A new class of algebras have been introduced by Khovanov and Lauda and independently by Rouquier. These algebras categorify one-half of the Quantum group associated to arbitrary Cartan data. In this paper, we use the combinatorics of Lyndon…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
A variety is a category of ordered (finitary) algebras presented by inequations between terms. We characterize categories enriched over the category of posets which are equivalent to a variety. This is quite analogous to Lawvere's classical…
In 2005, building on his own recent work and that of F. Zanello, A. Iarrobino discovered some constructions that, he conjectured, would yield level algebras with non-unimodal Hilbert functions. This thesis provides proofs of non-unimodality…
The character theory of finite groups has numerous basic questions that are often already quite involved: enumerating of irreducible characters, their character formulas, point-wise product decompositions, and restriction/induction between…
This book is mainly an exposition of the author's works and his joint works with his former students on explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…