Related papers: Note on the bijectivity of the Pak-Stanley labelli…
We define P-strict labelings for a finite poset P as a generalization of semistandard Young tableaux and show that promotion on these objects is in equivariant bijection with a toggle action on B-bounded Q-partitions of an associated poset…
I give a proof of the confluence of combinatory strong reduction that does not use the one of lambda-calculus. I also give simple and direct proofs of a standardization theorem for this reduction and the strong normalization of simply typed…
Let $\cal R$ be an ordered vector space over an ordered division ring. We prove that every definable set $X$ is a finite union of relatively open definable subsets which are definably simply-connected, settling a conjecture from [5]. The…
The paper presented here focuses on the classification of trivial source Specht modules. We completely classify the trivial source Specht modules labelled by hook partitions. We also classify the trivial source Specht modules labelled by…
Based on a bijection due to Fu and Tang, we provide combinatorial proofs of several partition identities of Andrews and Merca. We also introduce two weights for partitions to extend one of these identities.
We find a bijection between bi-banded paths and peak-counting paths, applying to two classes of lattice paths including Dyck paths. Thus we find a new interpretation of Narayana numbers as coefficients of weight polynomials enumerating…
Arnol'd proved in 1992 that Springer numbers enumerate the Snakes, which are type $B$ analogs of alternating permutations. Chen, Fan and Jia in 2011 introduced the labeled ballot paths and established a ``hard'' bijection with snakes.…
We unify and extend previous bijections on plane quadrangulations to bipartite and quasibipartite plane maps. Starting from a bipartite plane map with a distinguished edge and two distinguished corners (in the same face or in two different…
We contemplate a higher-level bipolar abstract argumentation for non-elementary arguments such as: X argues against Ys sincerity with the fact that Y has presented his argument to draw a conclusion C, by omitting other facts which would not…
Identification of string junction states of pure SU(2) Seiberg-Witten theory as B-branes wrapped on a Calabi-Yau manifold in the geometric engineering limit is discussed. The wrapped branes are known to correspond to objects in the bounded…
In this paper we show that a $k$-shellable simplicial complex is the expansion of a shellable complex. We prove that the face ring of a pure $k$-shellable simplicial complex satisfies the Stanley conjecture. In this way, by applying…
We present a completeness result for a logical system which combines stit logic and justification logic in order to represent proving activity of the agents. This logic is interpreted over the semantics introduced in earlier publications.…
In this expositional essay, we introduce some elements of the study of groups by analysing the braid pattern on a knitted blanket. We determine that the blanket features pure braids with a minimal number of crossings. Moreover, we determine…
We provide bijective proofs of two classic identities that are very simple to prove using generating functions, but surprisingly difficult to prove combinatorially. The problem of finding a bijective proof for the first identity was first…
We give a bijective proof of Hurwitz formula for the number of simple branched coverings of the sphere by itself. Our approach extends to double Hurwitz numbers and yields new properties for them. In particular we prove for double Hurwitz…
Proofs that a smooth morphism is flat available in the literature are long and difficult. We give a short proof of this fact.
We study additively graceful labelings of signed graphs on stars and double stars. While the case of signed stars is straightforward, the problem becomes significantly more intricate for signed double stars. We obtain a characterization of…
We discuss an obstruction to a knot being smoothly slice that comes from minimum-genus bounds on smoothly embedded surfaces in definite 4-manifolds. As an example, we provide an alternate proof of the fact that the (2,1)-cable of the figure…
A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…
There is a natural bijection between permutations obtainable using a stack (those avoiding the pattern 312) and permutations obtainable using a queue (those avoiding 321). This bijection is equivalent to one described by Simion and Schmidt…