English
Related papers

Related papers: Poincar\'{e} functions with spiders' webs

200 papers

In this note, we study the Hilbert-Poincar\'e polynomials for the PBW-graded of simple modules for a simple complex Lie algebra. The computation of their degree can be reduced to modules of fundamental highest weight. We provide these…

Representation Theory · Mathematics 2014-10-31 Teodor Backhaus , Lara Bossinger , Christian Desczyk , Ghislain Fourier

In this paper, we define, from a finite set E of functions, a family of holomorphic webs ${\cal W}(n;E)$ of codimension one in any dimension $ n $. We prove that it is sufficient to check a finite number of conditions for these webs to be…

Differential Geometry · Mathematics 2014-11-05 Jean-Paul Dufour , Daniel Lehmann

We consider the structure ${\mathbb R}^{\mathrm{RE}}$ obtained from $({\mathbb R},<,+,\cdot)$ by adjoining the restricted exponential and sine functions. We prove Wilkie's conjecture for sets definable in this structure: the number of…

Logic · Mathematics 2016-05-17 Gal Binyamini , Dmitry Novikov

Webs yield an especially important realization of certain Specht modules, irreducible representations of symmetric groups, as they provide a pictorial basis with a convenient diagrammatic calculus. In recent work, the last three authors…

Combinatorics · Mathematics 2025-10-01 Chris Fraser , Rebecca Patrias , Oliver Pechenik , Jessica Striker

A spider consists of several, say $N$, particles. Particles can jump independently according to a random walk if the movement does not violate some given restriction rules. If the movement violates a rule it is not carried out. We consider…

Probability · Mathematics 2015-03-13 Christophe Gallesco , Sebastian Muller , Serguei Popov , Marina Vachkovskaia

For a probability measure with compact and non-polar support in the complex plane we relate dynamical properties of the associated sequence of orthogonal polynomials $\{P_n\}$ to properties of the support. More precisely we relate the Julia…

Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to…

Combinatorics · Mathematics 2012-09-05 Sara Billey , Krzysztof Burdzy , Bruce Sagan

After defining in detail the Lambert $W$-function branches, we give a large number of exact identities involving (infinite) symmetric functions of these branches, as well as geometrically convergent series for all the branches. In doing so,…

Complex Variables · Mathematics 2021-01-19 Henri Cohen

In the present paper, the simplest scalar ODE case is studied for polynomials $$ \dot{w}=f(w)=(w-e_0)\cdot\ldots\cdot(w-e_{d-1}) $$ of degree $d$ with $d$ simple complex zeros. The explicit solution by separation of variables and explicit…

Dynamical Systems · Mathematics 2025-04-30 Bernold Fiedler

Let $P$ be a polynomial with a connected Julia set $J$. We use continuum theory to show that it admits a \emph{finest monotone map $\ph$ onto a locally connected continuum $J_{\sim_P}$}, i.e. a monotone map $\ph:J\to J_{\sim_P}$ such that…

Dynamical Systems · Mathematics 2016-01-25 A. Blokh , C. Curry , L. Oversteegen

We show that for every finite set of prime numbers S, there are at most finitely many singular moduli that are S-units. The key new ingredient is that for every prime number p, singular moduli are p-adically disperse. We prove analogous…

Number Theory · Mathematics 2023-09-07 Sebastián Herrero , Ricardo Menares , Juan Rivera-Letelier

We single out a large class of semisimple singularities with the property that all roots of the Poincar\'e polynomial of the Lie algebra of derivations of the corresponding suitably (not necessarily quasihomogeneously) graded moduli algebra…

Algebraic Geometry · Mathematics 2010-08-19 Mamuka Jibladze , Dmitry Novikov

Finding whether a linear-constraint loop has a linear ranking function is an important key to understanding the loop behavior, proving its termination and establishing iteration bounds. If no preconditions are provided, the decision problem…

Logic in Computer Science · Computer Science 2014-08-27 Amir M. Ben-Amram

Webs are a kind of planar, directed, edge-labeled graph that encode invariant vectors for quantum representations of $\mathfrak{sl}_n$. The theory of webs developed organically for $\mathfrak{sl}_2$, where they are also known as noncrossing…

Representation Theory · Mathematics 2025-10-16 Heather M. Russell , Julianna Tymoczko

We establish Sobolev-Poincar\'e inequalities for piecewise $W^{1,p}$ functions over families of fairly general polytopic (thence also shape-regular simplicial and Cartesian) meshes in any dimension; amongst others, they cover the case of…

Numerical Analysis · Mathematics 2026-02-25 Michele Botti , Lorenzo Mascotto

In this paper we give a unified proof of the fact that the Julia set of Newton's method applied to a holomorphic function of the complex plane (a polynomial of degree large than $1$ or an entire transcendental function) is connected. The…

Dynamical Systems · Mathematics 2015-01-23 Krzysztof Barański , Núria Fagella , Xavier Jarque , Bogusława Karpińska

Let $f$ and $g$ be permutable transcendental entire functions. We use a recent analysis of the dynamical behaviour in multiply connected wandering domains to make progress on the long standing conjecture that the Julia sets of $f$ and $g$…

Dynamical Systems · Mathematics 2015-03-30 Anna Miriam Benini , Philip J. Rippon , Gwyneth M. Stallard

Let $g$ be a holomorphic function in the neighbourhoods of an isolated essential singularity $v$: if $g$ omits a complex value there, then $v$ may be approached by a sequence of repelling fixed points for $g$, whose multipliers diverge to…

Complex Variables · Mathematics 2012-01-04 Claudi Meneghin

In this investigation we study a family of networks, called spiders, which covers a range of networks going from chains to complete graphs. These spiders are characterized by three parameters: the number of nodes in the core, the number of…

Combinatorics · Mathematics 2024-10-15 Leo Egghe , Li Li , Ronald Rousseau

Let $p$ and $q$ be positive integers. The $(p, q)$-leaper $L$ is a generalised knight which leaps $p$ units away along one coordinate axis and $q$ units away along the other. Consider a free $L$, meaning that $p + q$ is odd and $p$ and $q$…

Combinatorics · Mathematics 2022-05-24 Nikolai Beluhov
‹ Prev 1 4 5 6 7 8 10 Next ›