Related papers: Decompositions, approximate structure, transferenc…
This is an expository survey on the theory of Bernstein-Sato polynomials with special emphasis in its recent developments and its importance in commutative algebra.
Addition chains are a classical construction for fast exponentiation and related computation problems. In this paper, we study a chain for a fixed integer $n$ by decomposing each generator into a \emph{determiner} and a \emph{regulator}…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
Kim, K\"uhn, Osthus and Tyomkyn (Trans. Amer. Math. Soc. 371 (2019), 4655--4742) greatly extended the well-known blow-up lemma of Koml\'os, S\'ark\"ozy and Szemer\'edi by proving a `blow-up lemma for approximate decompositions' which states…
The aim of this article is to study a Cahn-Hilliard model for a multicomponent mixture with cross-diffusion effects, degenerate mobility and where only one of the species does separate from the others. We define a notion of weak solution…
We derive a method to efficiently compute the Green function of on arbitrary Hamiltonians defined on semi-infinite and periodic quasi-one-dimensional lattices. Computing the Green function is the backbone of quantum transport, electronic…
We build a bridge from density combinatorics to dimension theory of continued fractions. We establish a fractal transference principle that transfers common properties of subsets of $\mathbb N$ with positive upper density to properties of…
Reducibility methods, aiming to simplify systems by conjugating them to those with constant coefficients, are crucial for studying the existence of quasiperiodic solutions. In KAM theory for PDEs, these methods help address the…
In this announcement we generalize the Markov-Kakutani fixed point theorem for abelian semi-groups of affine transformations extending it on some class of non-commutative semi-groups. As an interesting example we apply it obtaining a…
We combine the fundamental results of Breuillard, Green, and Tao on the structure of approximate groups, together with "tame" arithmetic regularity methods based on work of the authors and Terry, to give a structure theorem for finite…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…
We survey four instances of the Fourier analytic 'transference principle' or 'dense model lemma', which allows one to approximate an unbounded function on the integers by a bounded function with similar Fourier transform. Such a result…
In this paper we further develop a Grassmannian technique used to prove results about very general hypersurfaces and present three applications. First, we provide a short proof of the Kobayashi Conjecture given previous results on the…
We introduce a new construction of embeddings of arbitrary recursive data structures into high dimensional vectors. These embeddings provide an interpretable model for the latent state vectors of transformers. We demonstrate that these…
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
We give a simple combinatorial criterion, in terms of an action on a hyperbolic simplicial complex, for a group to be hierarchically hyperbolic. We apply this to show that quotients of mapping class groups by large powers of Dehn twists are…
The general methods which are powerful for the necessity of bounded commutators are given. As applications, some necessary conditions for bounded commutators are first obtained in certain endpoint cases, and several new characterizations of…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
The aim of this paper is to develop a theory of finite transformation monoids and in particular to study primitive transformation monoids. We introduce the notion of orbitals and orbital digraphs for transformation monoids and prove a…
The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…