Related papers: A natural generalization of Balanced Tableaux
We present families of tableaux which interpolate between the classical semi-standard Young tableaux and matching field tableaux. Algebraically, this corresponds to SAGBI bases of Pl\"ucker algebras. We show that each such family of…
We introduce a general unifying framework for the investigation of pointlike sets. The pointlike functors are considered as distinguished elements of a certain lattice of subfunctors of the power semigroup functor; in particular, we exhibit…
In this work, we introduce the notion of regularization of bifunctions in a similar way as the well- known convex, quasiconvex and lower semicontinuous regularizations due to Crouzeix. We show that the Equilibrium Problems associated to…
We introduce tabular algebras, which are simultaneous generalizations of cellular algebras (in the sense of Graham-Lehrer) and table algebras (in the sense of Arad-Blau). We show that if a tabular algebra is equipped with a certain kind of…
In a recent paper I defined a new basis for the Grothendieck group of unipotent representations of an almost simple Chevalley group over a finite field. The definition for classical types was different from that for exceptional types. In…
We introduce generalized notions of a divergence function and a Fisher information matrix. We propose to generalize the notion of an exponential family of models by reformulating it in terms of the Fisher information matrix. Our methods are…
In this paper, we extend the classical arithmetic defined over the set of natural numbers N, to the set of all finite directed connected multigraphs having a pair of distinct distinguished vertices. Specifically, we introduce a model F on…
We introduce the notion of a standard weighted graph and show that every weighted graph has an essentially unique standard model. Moreover we classify birational transformations between such models. Our central result shows that these are…
Starting with univariate polynomial interpolation we arrive to a natural generalization of fundamental theorem of algebra for certain systems of multivariate algebraic equations.
In this paper we describe a new family of algebras which in the case of n = 2 reduces to the Fermion algebra and in the limiting case of n tends to infinity reduces to the Boson algebra. These generalized algebras describe particles which…
We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a graph. The graphs constructed here all satisfy a lower…
An increasing tableau is a semistandard tableau with strictly increasing rows and columns. It is well known that the Catalan numbers enumerate both rectangular standard Young tableaux of two rows and also Dyck paths. We generalize this to a…
We introduce judgemental theories and their calculi as a general framework to present and study deductive systems. As an exemplification of their expressivity, we approach dependent type theory and natural deduction as special kinds of…
We offer an axiomatic definition of a differential algebra of generalized functions over an algebraically closed non-Archimedean field. This algebra is of {\em Colombeau type} in the sense that it contains a copy of the space of Schwartz…
We give a thoroughful explanation of the general properties of different, general scales, corresponding to different (all possible) mathematical functions f(x), we mention and analyse many examples. These observations and statements might…
We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to…
Recently, a geometrical characterization of vector spaces served to generalize them into a new class of algebras. Instead of the algebraic properties of the underlying fields, we generalized the recently discovered property of such spaces…
Let $X$ be a finite set such that $|X|=n$. Let $\trans$ and $\sym$ denote respectively the transformation monoid and the symmetric group on $n$ points. Given $a\in \trans\setminus \sym$, we say that a group $G\leq \sym$ is $a$-normalizing…
We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study…
Abstract. This article determines relations between two notions concerning monoids: factorability structure, introduced to simplify the bar complex; and quadratic normalisation, introduced to generalise quadratic rewriting systems and…