Results 41 to 50 of about 68,778 (203)
Analysis of an algorithm catching elephants on the Internet [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 The paper deals with the problem of catching the elephants in the Internet traffic. The aim is to investigate an algorithm proposed by Azzana based on a multistage Bloom filter, with a refreshment mechanism (called $\textit{shift}$ in the present paper),
Yousra Chabchoub +3 more
doaj +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
Symplectic rigidity and quantum mechanics [PDF]
, 2018 Ideas from Hodge theory have found important applications in representation theory. We give a survey of joint work with Ben Elias which uncovers Hodge theoretic structure in the Hecke category ("Soergel bimodules"). We also outline similarities and differences to other combinatorial Hodge theories.
Guichard, Olivier, Wienhard, Anna
openaire +19 more sources
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
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
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
Steiner Triple Systems With High Discrepancy
Journal of Combinatorial Designs, EarlyView.ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 $r\ge 3$ and n ≡ 1 , 3 ( mod 6 ) $n\equiv 1,3\,(\mathrm{mod}\,6)$, any r $r$‐colouring of the triples on [ n ] $[n]$ admits a Steiner triple system of order n $n$ with discrepancy Ω ( n 2 ) ${\rm{\Omega }}({
Lior Gishboliner +2 more
wiley +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
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
Characterizations and algorithms for generalized Cops and Robbers games [PDF]
, 2016 We propose a definition of generalized Cops and Robbers games where there are two players, the Pursuer and the Evader, who each move via prescribed rules.
Bonato, Anthony, MacGillivray, Gary
core +4 more sources