Results 61 to 70 of about 70,780 (208)
Some local--global phenomena in locally finite graphs
, 2020 In this paper we present some results for a connected infinite graph $G$ with finite degrees where the properties of balls of small radii guarantee the existence of some Hamiltonian and connectivity properties of $G$. (For a vertex $w$ of a graph $G$ the
Asratian, Armen S. +2 more
core +1 more source
Constrained exchangeable partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
Alexander Gnedin
doaj +1 more source
Integrable Combinatorics [PDF]
, 2012 We review various combinatorial problems with underlying classical or quantum integrable structures. (Plenary talk given at the International Congress of Mathematical Physics, Aalborg, Denmark, August 10, 2012.)Comment: 21 pages, 16 figures, proceedings ...
Di Francesco, Philippe
core +1 more source
Random assignment and shortest path problems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by
Johan Wästlund
doaj +1 more source
New bounds for equiangular lines
, 2014 A set of lines in $\mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We address the question of determining the maximum size of equiangular line sets in $\mathbb{R}^n$, using semidefinite programming to improve the ...
Barg, Alexander, Yu, Wei-Hsuan
core +1 more source
Recursive and Cyclic Constructions for Double‐Change Covering Designs
Journal of Combinatorial Designs, EarlyView.ABSTRACT A double‐change covering design (DCCD) is a v $v$‐set V $V$ and an ordered list L ${\mathscr{L}}$ of b $b$ blocks of size k $k$ where every pair from V $V$ must occur in at least one block and each pair of consecutive blocks differs by exactly two elements. It is minimal if it has the fewest blocks possible and circular when the first and last
Amanda Lynn Chafee, Brett Stevens
wiley +1 more source
Mixed Powers of Generating Functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Given an integer $m \geq 1$, let $\| \cdot \|$ be a norm in $\mathbb{R}^{m+1}$ and let $\mathbb{S}_+^m$ denote the set of points $\mathbf{d}=(d_0,\ldots,d_m)$ in $\mathbb{R}^{m+1}$ with nonnegative coordinates and such that $\| \mathbf{d} \|=1$. Consider
Manuel Lladser
doaj +1 more source
Beck's Conjecture for Power Graphs [PDF]
, 2014 Beck's conjecture on coloring of graphs associated to various algebraic objects has generated considerable interest in the community of discrete mathematics and combinatorics since its inception in the year 1988.
Das, Priya, Mukherjee, Himadri
core
Subsquares in Random Latin Squares and Rectangles
Journal of Combinatorial Designs, EarlyView.ABSTRACT A k×n $k\times n$ partial Latin rectangle is C‐sparse $C \mbox{-} \mathrm{sparse}$ if the number of nonempty entries in each row and column is at most C $C$ and each symbol is used at most C $C$ times. We prove that the probability a uniformly random k×n $k\times n$ Latin rectangle, where k<(1∕2−α)n $k\lt (1\unicode{x02215}2-\alpha )n ...
Alexander Divoux +3 more
wiley +1 more source
The first ascent of size $d$ or more in compositions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 A composition of a positive integer $n$ is a finite sequence of positive integers $a_1, a_2, \ldots, a_k$ such that $a_1+a_2+ \cdots +a_k=n$. Let $d$ be a fixed nonnegative integer.
Charlotte Brennan, Arnold Knopfmacher
doaj +1 more source