Results 71 to 80 of about 1,223,570 (139)
Some results at the interface of combinatorics and number theory [PDF]
We present some results in the union and sometimes in the intersection of combinatorics and number ...
Chase, Zachary
core +1 more source
Majority Dynamics on Finite Trees
Random Structures &Algorithms, Volume 69, Issue 2, September 2026.ABSTRACT For an arbitrary finite tree T$$ T $$, we find the exact value of the worst‐case stabilization time of majority dynamics on T$$ T $$. We also prove that for a perfect rooted cubic tree T$$ T $$ with diameter D$$ D $$ and uniformly random initial opinions, the dynamics stabilizes in time τ∈(D/4,D/3)$$ \tau \in \left(D/4,D/3\right) $$ with high ...
Itai Benjamini +2 more
wiley +1 more source
SMARANDACHE MULTI-SPACE THEORY, Second Edition [PDF]
, 2011 We are used to the idea that our space has three dimensions: length, breadth and height with time providing the fourth dimension of spacetime by Einstein. In the string or superstring theories, we encounter 10 dimensions.
MAO, Linfan
core +1 more source
On the Threshold for Triangulations Inside Convex Polygons
Random Structures &Algorithms, Volume 69, Issue 2, September 2026.ABSTRACT Start with a large convex polygon and add all other edges inside independently with probability p$$ p $$. At what critical threshold pc$$ {p}_c $$ do triangulations of the polygon begin to appear? The first author and Gravner asked this question and observed that pc=Θ(1)$$ {p}_c=\Theta (1) $$, using the relationship with the Catalan numbers ...
Brett Kolesnik +2 more
wiley +1 more source
Convergence and combinatorics of the Reverse algorithm
Bulletin of the London Mathematical Society, Volume 58, Issue 9, September 2026.Abstract We study the Reverse algorithm, a multidimensional continued fraction algorithm, which is not unimodular. We show that the Reverse algorithm is ergodic and, by proving that its second Lyapunov exponent is negative, that it is a.e. exponentially convergent.
Hiroaki Ito +2 more
wiley +1 more source
Sortable Elements for Quivers with Cycles [PDF]
, 2009 Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W.
Speyer, David E., Reading, Nathan
core
Mathematical Combinatorics (International Book Series)
, 2016 The Mathematical Combinatorics (International Book Series) is a fully refereed international book series with ISBN number on each issue, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 100-150 pages approx.
openaire +2 more sources
Strength and partition rank under limits and field extensions
Bulletin of the London Mathematical Society, Volume 58, Issue 9, September 2026.Abstract The strength of a multivariate homogeneous polynomial is the minimal number of terms in an expression as a sum of products of lower‐degree homogeneous polynomials. Partition rank is the analogue for multilinear forms. Both ranks can drop under field extensions, and both can jump in a limit.
Arthur Bik +3 more
wiley +1 more source
Cauchy identities for staircase matrices
Journal of the London Mathematical Society, Volume 114, Issue 3, September 2026.Abstract The well‐known Cauchy identity expresses the product of terms (1−xiyj)−1${(1-{x}_{i}{y}_{j})}^{-1}$ for (i,j)$(i,j)$ indexing entries of a rectangular m×n$m\ensuremath{\times{}}n$‐matrix as a sum over partitions λ$\lambda $ of products of Schur polynomials: sλ(x)sλ(y)${s}_{\lambda}(x){s}_{\lambda}(y)$.
Evgeny Feigin +2 more
wiley +1 more source
Maximal subgroups of free idempotent-generated semigroups over the full transformation monoid [PDF]
, 2011 Let Tn be the full transformation semigroup of all mappings from the set {1, . . . , n} to itself under composition. Let E = E(Tn) denote the set of idempotents of Tn and let e ∈ E be an arbitrary idempotent satisfying |im (e)| = r ≤ n − 2. We prove that
Ruskuc, N. +3 more
core +1 more source