Related papers: Garside and quadratic normalisation: a survey
In this paper, we address the problem of learning the structure of a pairwise graphical model from samples in a high-dimensional setting. Our first main result studies the sparsistency, or consistency in sparsity pattern recovery,…
The main purpose of this paper is twofold. We first want to analyze in details the meaningful geometric aspect of the method introduced in the previous paper [12], concerning regularity of families of irreducible, nodal "curves" on a…
We first prove the Grinberg-Kazhdan formal arc theorem without any assumptions on the characteristic. This part of the article is equivalent to arXiv:math-AG/0203263. Then we try to clarify the geometric ideas behind the proof by…
Consider the problem of choosing a set of actions to optimize an objective function that is a real-valued polymatroid function subject to matroid constraints. The greedy strategy provides an approximate solution to the optimization problem,…
On the model of simple braids, defined to be the left divisors of Garside's elements $\Delta\_n$ in the monoid $B\_\infty^+$ , we investigate simple elements in Thompson's monoid $F^+$ and in a larger monoid $H^+$ that is a hybrid of…
We expound the properties of ribbons in a setting which is general enough to encompass spherical Artin monoids and dual braid monoids of well-generated complex reflection groups. We generalize to our setting results on parabolic subgroups…
The results of the renormalization group are commonly advertised as the existence of power law singularities near critical points. The classic predictions are often violated and logarithmic and exponential corrections are treated on a…
The Column Subset Selection Problem provides a natural framework for unsupervised feature selection. Despite being a hard combinatorial optimization problem, there exist efficient algorithms that provide good approximations. The drawback of…
In this paper, we define generalized braid theories in alignment with the language of Fenn and Bartholomew for knot theories, and compute a generating set for the pure generalized braid theories. Using this, we prove that every oriented…
This article is a survey on the braid groups, the Artin groups, and the Garside groups. It is a presentation, accessible to non-experts, of various topological and algebraic aspects of these groups. It is also a report on three points of…
Every action of a finite group scheme $G$ on a variety admits a projective equivariant model, but not necessarily a normal one. As a remedy, we introduce and explore the notion of $G$-normalization. In particular, every curve equipped with…
This paper pursues a twofold goal. First, we introduce and study in detail a new notion of variational analysis called generalized metric subregularity, which is a far-going extension of the conventional metric subregularity conditions. Our…
The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the…
We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…
We propose a new yet natural algorithm for learning the graph structure of general discrete graphical models (a.k.a. Markov random fields) from samples. Our algorithm finds the neighborhood of a node by sequentially adding nodes that…
Weight norm $\|w\|$ and margin $\gamma$ participate in learning theory via the normalized margin $\gamma/\|w\|$. Since standard neural net optimizers do not control normalized margin, it is hard to test whether this quantity causally…
This work is dedicated to the results were got in the model theory of the regular polygons. We give the characterization of the monoids with axiomatizable and model complete class of regular polygons. We describe the monoids with complete…
We generalise a sparsity condition for hypergraphs and show a result relating sparseness of hypergraphs to the decomposition of a modified incidence graph into edge-disjoint forests. We also give new sparsity conditions for posets and…
We study a subset of square free positive braids and we give a few algebraic characterizations of them and one geometric characterization: the set of positive braids whose closures are unlinks. We describe canonical forms of these braids…
In this paper, we study renormalization, that is, the procedure for eliminating singularities, for a special model using both combinatorial techniques in the framework of working with formal series, and using a limit transition in a…