Results 81 to 90 of about 73,517 (203)

Combinatorics on partial word correlations

Journal of Combinatorial Theory, Series A, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Blanchet-Sadri, F., Fowler, Justin, Gafni, Joshua D., Wilson, Kevin H.   +3 more
openaire   +1 more source

A note on the Steinitz lemma

Mathematika, Volume 72, Issue 2, April 2026.
Abstract We establish the connection between the Steinitz problem for ordering vector families in arbitrary norms and its variant for not necessarily zero‐sum families consisting of “nearly unit” vectors.
Gergely Ambrus, Rainie Heck
wiley   +1 more source

Circle packings, renormalizations, and subdivision rules

Proceedings of the London Mathematical Society, Volume 132, Issue 4, April 2026.
Abstract In this paper, we use iterations of skinning maps on Teichmüller spaces to study circle packings and develop a renormalization theory for circle packings whose nerves satisfy certain subdivision rules. We characterize when the skinning map has bounded image.
Yusheng Luo, Yongquan Zhang
wiley   +1 more source

Sintagmatics vs. Combinatorics: Basic Principles of Combinatorial Linguistics

Научный диалог, 2017
The article is devoted to syntagmatics and combinatorics that form the basis of combinatorial linguistics or science of language which studies linear relations of language units and their combinatorial potential.
M. V. Vlavatskaya
doaj  

Thinning to Improve Two‐Sample Discrepancy

Random Structures &Algorithms, Volume 68, Issue 2, March 2026.
ABSTRACT The discrepancy between two independent samples X1,…,Xn$$ {X}_1,\dots, {X}_n $$ and Y1,…,Yn$$ {Y}_1,\dots, {Y}_n $$ drawn from the same distribution on ℝd$$ {\mathbb{R}}^d $$ typically has order O(n)$$ O\left(\sqrt{n}\right) $$ even in one dimension.
Gleb Smirnov, Roman Vershynin
wiley   +1 more source

Properties of Pseudo-Primitive Words and their Applications [PDF]

, 2010
A pseudo-primitive word with respect to an antimorphic involution \theta is a word which cannot be written as a catenation of occurrences of a strictly shorter word t and \theta(t).
Kari, Lila, Masson, Benoît, Seki, Shinnosuke   +2 more
core   +1 more source

Subexponential estimations in Shirshov's height theorem (in English)

, 2012
In 1993 E. I. Zelmanov asked the following question in Dniester Notebook: "Suppose that F_{2, m} is a 2-generated associative ring with the identity x^m=0.
, A. A. Lopatin, A. G. Kolotov, A. I. Shirshov, A. I. Shirshov, A. Kanel-Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, Aleksei Ya Belov, C. Procesi, E. N. Kuz'min, E. S. Chibrikov, G. P. Chekanu (Ciocanu), G. P. Chekanu (Ciocanu), Gh. Ciocanu, Gh. P. Ciocanu, Gh. P. Ciocanu, I. I. Bogdanov, M. I. Kharitonov, M. I. Kharitonov, M. Kharitonov, M. Lothaire, M. Lothaire, Mikhail I Kharitonov, S. P. Mishchenko, S. V. Pchelintsev, S. V. Pchelintsev, V. A. Ufnarovskij, V. A. Ufnarovskiĭ, V. A. Ufnarovskiĭ, V. A. Ufnarovskiĭ, V. Drensky, V. N. Latyshev, Yu. P. Razmyslov   +38 more
core   +1 more source

Solving a Random Asymmetric TSP Exactly in Quasi‐Polynomial Time W.H.P.

Random Structures &Algorithms, Volume 68, Issue 2, March 2026.
ABSTRACT Let the costs C(i,j)$$ C\left(i,j\right) $$ for an instance of the Asymmetric Traveling Salesperson Problem (ATSP) be independent copies of a nonnegative random variable C$$ C $$ from a class of distributions that include the uniform [0,1]$$ \left[0,1\right] $$ distribution and the exponential mean 1 distribution with mean 1.
Tolson Bell, Alan M. Frieze
wiley   +1 more source

Continuity properties of the lower spectral radius

, 2014
The lower spectral radius, or joint spectral subradius, of a set of real $d \times d$ matrices is defined to be the smallest possible exponential growth rate of long products of matrices drawn from that set.
Bochi, Jairo, Morris, Ian D.
core   +1 more source

Cyclic Subsets of Tournaments

Random Structures &Algorithms, Volume 68, Issue 2, March 2026.
ABSTRACT Let G$$ G $$ be a Dirac graph, and let S$$ S $$ be a vertex subset of G$$ G $$, chosen uniformly at random. How likely is the induced subgraph G[S]$$ G\left[S\right] $$ to be Hamiltonian? This question, proposed by Erdős and Faudree in 1996, was recently resolved by Draganić, Keevash, and Müyesser, in the setting of graphs.
Zach Hunter, Teng Liu, Aleksa Milojević, Benny Sudakov   +3 more
wiley   +1 more source