Related papers: On Hook Formulas for Cylindric Skew Diagrams
We produce a new basis for the Schur and Weyl modules associated to a row-convex shape, D. The basis is indexed by new class of "straight" tableaux which we introduce by weakening the usual requirements for standard tableaux. Spanning is…
Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and…
Let X be a smooth quasi-projective variety over the algebraic closure of the rational number field. We show that the cycle map of the higher Chow group to Deligne cohomology is injective and the higher Hodge cycles are generated by the…
We develop a sketching algorithm to find the point on the convex hull of a dataset, closest to a query point outside it. Studying the convex hull of datasets can provide useful information about their geometric structure and their…
Using a 0/1 encoding of Young diagrams and its consequences for rim hook tableaux, we prove a reduction formula of Littlewood for arbitrary characters of the symmetric group, evaluated at elements with all cycle lengths divisible by a given…
New sufficient conditions and necessary conditions are developed for two skew diagrams to give rise to the same skew Schur function. The sufficient conditions come from a variety of new operations related to ribbons (also known as border…
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…
For the product $X=C\times S$ of a curve and a surface over a number field, we construct unconditionally a Beilinson--Bloch type height pairing for homologically trivial algebraic cycles on $X$. Then for an embedding $f: C\to S$, we define…
We introduce a new diagrammatic notation for representing the result of (algebraic) effectful computations. Our notation explicitly separates the effects produced during a computation from the possible values returned, this way simplifying…
We consider families of finite sets that we call shellable and that have been characterized by Chang and by Hirst and Hughes as being the families of sets that admit unique solutions to Hall's marriage problem. In this paper, we introduce a…
A diagrammatic logical calculus for the syllogistic reasoning is introduced and discussed. We prove that a syllogism is valid if and only if it is provable in the calculus.
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be…
Lie scale invariance is used to reduce the incompressible Navier-Stokes equations to non-linear ordinary equations. This yields a formulation in terms of logarithmic spirals as independent variables. We give the equations when the spirals…
We provide a new branching rule from the general linear group $GL_{2n}(\mathbb{C})$ to the symplectic group $Sp_{2n}(\mathbb{C})$ by establishing a simple algorithm which gives rise to a bijection from the set of semistandard tableaux of a…
We give an account of the construction of exterior differential systems based on the notion of tableaux over Lie algebras as developed in [Comm. Anal. Geom 14 (2006), 475-496; math.DG/0412169]. The definition of a tableau over a Lie algebra…
We set out a general methodology for producing tableau systems for propositional logics via a tableau metatheory that provides general and formal notions for different tableau systems that vary by semantics or formulae. Moreover, by dint of…
We conjecture a multi-parameter generalization of the toric inequalities of \cite{Czech:2023xed}. We then extend their proof methods for the generalized toric inequalities in two ways. The first extension constructs the graph corresponding…
An abundance of real-world problems manifest as covering edges and/or vertices of a graph with cliques that are optimized for some objectives. We consider different structural parameters of graph, and design fixed-parameter tractable…
The purposes of this article are threefold. First, to determine numerically when an arbitrary blowup of a smooth surface is smooth. We show the surface is smooth if and only if certain rational parameters involving log discrepancy and…
Traditional treatments of formal logic provide: 1. A syntax for formulas. 2. An inference relation between sets of formulas. 3. A rule for assigning meaning to formulas (semantics) that is sound with respect to the inference relation. First…