Results 41 to 50 of about 69,347 (192)
A Novel Approach to Topological Indices of the Identity Graph Associated with the Finite Group
Jurnal DiferensialGraph theory is applied to study network structures in various disciplines, such as computer science and discrete mathematics. The combination of graphs and algebra has become a widely discussed topic in research within the fields of algebra and ...
Abdul Gazir Syarifudin +4 more
doaj +1 more source
Tiling a Rectangle with Polyominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 A polycube in dimension $d$ is a finite union of unit $d$-cubes whose vertices are on knots of the lattice $\mathbb{Z}^d$. We show that, for each family of polycubes $E$, there exists a finite set $F$ of bricks (parallelepiped rectangles) such that the ...
Olivier Bodini
doaj +1 more source
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
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
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
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
Simple 3‐Designs of PSL ( 2 , 2 n ) With Block Size 13
Journal of Combinatorial Designs, EarlyView.ABSTRACT This paper focuses on the investigation of simple 3‐ ( 2 n + 1 , 13 , λ ) designs admitting PSL ( 2 , 2 n ) as an automorphism group. Such designs arise from the orbits of 13‐element subsets under the action of PSL ( 2 , 2 n ) on the projective line X = GF ( 2 n ) ∪ { ∞ }, and any union of these orbits also forms a 3‐design.
Takara Kondo, Yuto Nogata
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
Combinatorial optimization approach for the efficient reuse of RC components
Structural Concrete, EarlyView.Abstract The reuse of reinforced concrete (RC) components from deconstructed buildings offers a promising approach to reduce the environmental impact of new constructions. However, it represents a complex combinatorial optimization problem to efficiently place the available modules, which vary in geometry and load‐bearing capacity, into new structures ...
Jannis Rose +4 more
wiley +1 more source