相关论文: What is a Young tableau?

Tensor polynomial identities generalize the concept of polynomial identities on $d \times d$ matrices to identities on tensor product spaces. Here we completely characterize a certain class of tensor polynomial identities in terms of their…

The understanding of probability can be difficult for a few young scientists. Consequently, this new mathematical symbol, related to binomial coefficients and simplicial polytopic numbers, could be helpful to science education. Moreover,…

A tableau calculus is proposed, based on a compressed representation of clauses, where literals sharing a similar shape may be merged. The inferences applied on these literals are fused when possible, which reduces the size of the proof. It…

Let SYT_n be the set of all standard Young tableaux with n cells. After recalling the definitions of four partial orders, the weak, KL, geometric and chain orders on SYT_n and some of their crucial properties, we prove three main results:…

This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with…

An inverted semistandard Young tableau is a row-standard tableau along with a collection of inversion pairs that quantify how far the tableau is from being column semistandard. Such a tableau with precisely $k$ inversion pairs is said to be…

In this text, we wish to provide the reader with a short guide to recent works on the theory of dilatations in Commutative Algebra and Algebraic Geometry. These works fall naturally into two categories: one emphasises foundational and…

We discuss tableaux for the Implicational Propositional Calculus and show how they may be used to establish its completeness.

We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…

A non associative, noncommutative algebra is defined that may be interpreted as a set of vector modules over a noncommutative surface of rotation. Two of these vector modules are identified with the analogues of the tangent and cotangent…

In this survey we discuss the notion of combinatorial interpretation in the context of Algebraic Combinatorics and related areas. We approach the subject from the Computational Complexity perspective. We review many examples, state a…

This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…

We present a formalism that represents pure states, mixtures and generalized states as functionals on an algebra containing the observables of the system. Along these states, there are other functionals that decay exponentially at all times…

Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which…

In our companion paper, we develop a new $SL_4$-web basis. Basis elements are given by certain planar graphs and are constructed so that important algebraic operations can be performed diagrammatically. A guiding principle behind our…

We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the…

We consider two partial orders on standard Young tableaux. The first one is induced from the weak right Bruhat order on symmetric group by Robinson-Schensted algorithm. The second one is induced from the order on Young diagrams by…

Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…

Primarily this paper presents an expository report on alternatives to the traditional methods of classifying representations of finite dimensional algebras. Some new results illustrating such alternatives for algebras with only finitely…

This research addresses a new tool for data analysis known as Topological Data Analysis TDA It underlies an area of Mathematics known as Combinatorial Algebra or more recently Algebraic Topology which through making strong use of…