Flag f-vectors and the cd-index.
The descent set and connectivity set of a permutation.
Flag-symmetric and locally rank-symmetric partially ordered sets.
Parking functions and noncrossing partitions.
Solution de la question 377
An arithmetic analogue of Clifford's theorem
Number fields can be viewed as analogues of curves over fields. Here we use metrized line bundles as analogues of divisors on curves. Van der Geer and Schoof gave a definition of a function on metrized line bundles that resembles properties of the dimension of , where is a divisor on a curve . In particular, they get a direct analogue of the Rieman-Roch theorem. For three theorems of curves, notably Clifford’s theorem, we will propose arithmetic analogues.
An arithmetic analogue of Clifford's theorem.
Irreducible symmetric group characters of rectangular shape.
Linear Diophantic Equations and Local Cohomology.
Decomposition of Pascal's kernels mod .
Promotion and evacuation.
Profesor Eubanks v říši Dzéta
Proper moving average representations and outer functions in two variables.
A note on symmetric powers of the standard representation of .
Resonance surfaces for forced oscillators.
Bottom Schur functions.
Hilbert schemes and stable pairs: GIT and derived category wall crossings
We show that the Hilbert scheme of curves and Le Potier’s moduli space of stable pairs with one dimensional support have a common GIT construction. The two spaces correspond to chambers on either side of a wall in the space of GIT linearisations. We explain why this is not enough to prove the “DT/PT wall crossing conjecture” relating the invariants derived from these moduli spaces when the underlying variety is a 3-fold. We then give a gentle introduction to a small part of Joyce’s theory for such...
Modelling integer linear programs with Petri nets
Modelling integer linear programs with petri nets
We show in this paper that timed Petri nets, with one resource shared by all the transitions, are directly connected to the modelling of integer linear programs (ILP). To an ILP can be automatically associated an equivalent Petri net. The optimal reachability delay is an optimal solution of the ILP. We show next that a net can model any ILP. I order to do this, we give a new sufficient reachability condition for the marking equation, which also holds for general Petri nets without timed transitions. ...
Solving scheduling problems using Petri nets and constraint logic programming
Page 1 Next