Results 81 to 90 of about 56,755 (205)
On Spectral Graph Determination
The study of spectral graph determination is a fascinating area of research in spectral graph theory and algebraic combinatorics. This field focuses on examining the spectral characterization of various classes of graphs, developing methods to construct ...
Igal Sason +3 more
doaj +1 more source
The Combinatorics of Iterated Loop Spaces
It is well known since Stasheff's work that 1-fold loop spaces can be described in terms of the existence of higher homotopies for associativity (coherence conditions) or equivalently as algebras of contractible non-symmetric operads.
Batanin, M. A.
core +1 more source
Universal gap growth for Lyapunov exponents of perturbed matrix products
Abstract We study the quantitative simplicity of the Lyapunov spectrum of d$d$‐dimensional bounded matrix cocycles subjected to additive random perturbations. In dimensions 2 and 3, we establish explicit lower bounds on the gaps between consecutive Lyapunov exponents of the perturbed cocycle, depending only on the scale of the perturbation.
Jason Atnip +3 more
wiley +1 more source
Bayer noise quasisymmetric functions and some combinatorial algebraic structures [PDF]
Recently, quasisymmetric functions have been widely studied due to their big connection to enumerative combinatorics, combinatorial Hopf algebra and number theory.
Adnan Abdulwahid
doaj +1 more source
Ibadan Lectures on Toric Varieties
Toric varieties are perhaps the most accessible class of algebraic varieties. They often arise as varieties parameterized by monomials, and their structure may be completely understood through objects from geometric combinatorics.
Sottile, Frank
core
On the Representation Theory of an Algebra of Braids and Ties
We consider the algebra ${\cal E}_n(u)$ introduced by F. Aicardi and J. Juyumaya as an abstraction of the Yokonuma-Hecke algebra. We construct a tensor space representation for ${\cal E}_n(u)$ and show that this is faithful. We use it to give a basis for
A. Gyoja +19 more
core +1 more source
Some bounds related to the 2‐adic Littlewood conjecture
Abstract For every irrational real α$\alpha$, let M(α)=supn⩾1an(α)$M(\alpha) = \sup _{n\geqslant 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or ∞$\infty$, if unbounded). The 2‐adic Littlewood conjecture (2LC) can be stated as follows: There exists no irrational α$\alpha$ such that M(2kα)$M(2^k \alpha)$ is ...
Dinis Vitorino, Ingrid Vukusic
wiley +1 more source
Thom series of contact singularities [PDF]
Thom polynomials measure how global topology forces singularities. The power of Thom polynomials predestine them to be a useful tool not only in differential topology, but also in algebraic geometry (enumerative geometry, moduli spaces) and algebraic ...
Fehér, L. M., Rimányi, R.
core
Non‐vanishing of Poincaré series on average
Abstract We study when Poincaré series for congruence subgroups do not vanish identically. We show that almost all Poincaré series with suitable parameters do not vanish when either the weight k$k$ or the index m$m$ varies in a dyadic interval. Crucially, analyzing the problem ‘on average’ over these weights or indices allows us to prove non‐vanishing ...
Ned Carmichael, Noam Kimmel
wiley +1 more source
Discrepancy of arithmetic progressions in boxes and convex bodies
Abstract The combinatorial discrepancy of arithmetic progressions inside [N]:={1,…,N}$[N]:= \lbrace 1, \ldots, N\rbrace$ is the smallest integer D$D$ for which [N]$[N]$ can be colored with two colors so that any arithmetic progression in [N]$[N]$ contains at most D$D$ more elements from one color class than the other.
Lily Li, Aleksandar Nikolov
wiley +1 more source

