相关论文: Parking Functions and Descent Algebras

This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave)…

A classical parking function of length $n$ is a list of positive integers $(a_1, a_2, \ldots, a_n)$ whose nondecreasing rearrangement $b_1 \leq b_2 \leq \cdots \leq b_n$ satisfies $b_i \leq i$. The convex hull of all parking functions of…

In this work, we analyze the regularizing property of the stochastic gradient descent for the efficient numerical solution of a class of nonlinear ill-posed inverse problems in Hilbert spaces. At each step of the iteration, the method…

We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…

We find an explicit $S_n$-equivariant bijection between the integral points in a certain zonotope in $\mathbb{R}^n$, combinatorially equivalent to the permutahedron, and the set of $m$-parking functions of length $n$. This bijection…

We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…

Algebraic operations are understood as topologiztion of algebra. They become an example of simplest convergence space. In our article the convergence is a arbitrary multivalued appointment. The continuity of some mapping between two…

The descent algebra of the symmetric group, over a field of non-zero characteristic p, is studied. A homomorphism into the algebra of generalised p-modular characters of the symmetric group is defined. This is then used to determine the…

The foundational character of certain algebraic structures as Boolean algebras and Heyting algebras is rooted in their potential to model classical and constructive logic, respectively. In this paper we discuss the contributions of…

Let $\mathfrak{S}_n$ denote the symmetric group and let $W(\mathfrak{S}_n)$ denote the weak order of $\mathfrak{S}_n$. Through a surprising connection to a subset of parking functions, which we call unit Fubini rankings, we provide a…

In this paper we give an effective characterization of Hilbert functions and polynomials of standard algebras over an Artinian equicharacteristic local ring; the cohomological properties of such algebras are also studied. We describe…

We develop a categorical and algebro-geometric treatment of localization for cohomological theories endowed with an open--closed recollement. Starting from a class on a space whose restriction to the open complement vanishes, we show that…

A derived operation is a bilinear operation on a commutative associative algebra $A$ defined intrinsically out of its product and several derivations of the product. We show that operators of left (or right) multiplications of a derived…

We study the structure of renormalization Hopf algebras of gauge theories. We identify certain Hopf subalgebras in them, whose character groups are semidirect products of invertible formal power series with formal diffeomorphisms. This can…

We prove that algebraic stacks satisfy 2-descent for fppf coverings. We generalize Galois descent for schemes to stacks, by considering the case where the fppf covering is a finite Galois covering, and reformulating 2-descent data in terms…

We define graded Hopf algebras with bases labeled by various types of graphs and hypergraphs, provided with natural embeddings into an algebra of polynomials in infinitely many variables. These algebras are graded by the number of edges and…

Suppose that $h$ and $g$ belong to the algebra $\B$ generated by the rational functions and an entire function $f$ of finite order on ${\Bbb C}^n$ and that $h/g$ has algebraic polar variety. We show that either $h/g\in\B$ or $f=q_1e^p+q_2$,…

Stochastic gradient descent is one of the most successful approaches for solving large-scale problems, especially in machine learning and statistics. At each iteration, it employs an unbiased estimator of the full gradient computed from one…

We propose a characterization of $k$-Naples parking functions in terms of subsequences with the structure of a complete $k$-Naples parking function. We define complete parking preferences by requiring that for all $j=2,\dots,n$, the number…

Parking sequences (a generalization of parking functions) are defined by specifying car lengths and requiring that a car attempts to park in the first available spot after its preference. If it does not fit there, then a collision occurs…