Results 71 to 80 of about 1,399 (173)
Polyominoes determined by permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 In this paper we consider the class of $\textit{permutominoes}$, i.e. a special class of polyominoes which are determined by a pair of permutations having the same size. We give a characterization of the permutations associated with convex permutominoes,
I. Fanti +4 more
doaj +1 more source
Large Deviations of the Giant Component in Scale‐Free Inhomogeneous Random Graphs
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT We study large deviations of the size of the largest connected component in a general class of inhomogeneous random graphs with iid weights, parametrized so that the degree distribution is regularly varying. We derive a large‐deviation principle with logarithmic speed: the rare event that the largest component contains linearly more vertices ...
Joost Jorritsma, Bert Zwart
wiley +1 more source
Is It Easier to Count Communities Than Find Them?
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT Random graph models with community structure have been studied extensively in the literature. For both the problems of detecting and recovering community structure, an interesting landscape of statistical and computational phase transitions has emerged. A natural unanswered question is: Might it be possible to infer properties of the community
Cynthia Rush +3 more
wiley +1 more source
Geometric Planted Matchings Beyond the Gaussian Model
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT We consider the problem of recovering an unknown matching between a set of n$$ n $$ randomly placed points in ℝd$$ {\mathbb{R}}^d $$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity resolution.
Lucas R. Schwengber, Roberto I. Oliveira
wiley +1 more source
Maximum Induced Trees and Forests of Bounded Degree in Random Graphs
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT The asymptotic behavior of the maximum sizes of induced trees and forests has been studied extensively in the last few decades, though the overall picture is far from being complete. In this paper, we close several significant gaps: (1) We prove 2‐point concentration of the maximum sizes of an induced forest and an induced tree with maximum ...
Margarita Akhmejanova +2 more
wiley +1 more source
Renormalization techniques for inflation systems and some of their applications
Acta Crystallographica Section A, Volume 82, Issue 4, Page 294-304, July 2026.In this work, renormalization methods for quantities related to the diffraction of inflation systems are surveyed.Exact renormalization techniques are important and powerful, particularly for inflation‐generated systems. We review recent results in this direction.
Michael Baake +4 more
wiley +1 more source
Journal of the London Mathematical Society, Volume 114, Issue 1, July 2026.Abstract Dedekind's problem, dating back to 1897, asks for the total number ψ(n)$\psi (n)$ of antichains contained in the Boolean lattice Bn$B_n$ on n$n$ elements. We study Dedekind's problem using a recently developed method based on the cluster expansion from statistical physics, and as a result, obtain several new results on the number and typical ...
Matthew Jenssen +2 more
wiley +1 more source
, 2008 subsets are considered. The problem considered is in simple description of all set of partitioning characteristic vectors. A smaller generating sets are known as “boundary ” and ”steepest ” sets and finally we prove that the intersection of these two ...
Hasmik Sahakyan
core
APPLICATION OF COMBINATORICS IN DISCRETE MATHEMATICS AND ALGORITHMS
Combinatorics, as a branch of discrete mathematics, studies combinatorial structures and methods of their analysis. Its core tools, such as permutations, combinations, and placements, play a key role in various fields, including algorithms, optimization, cryptography, and graph theory. In this article, we will look at how combinatorics is used to solve
openaire +1 more source
Appunti di Matematica Discreta
, 2015 Introduzione a vari aspetti della matematica discreta: studio della combinatoria, alcuni elementi di teoria dei numeri (Teorema cinese dei resti) con applicazioni alla teoria dei codici correttori e alla crittografia classica e a chiave pubblica. Studio
CAPPARELLI, Stefano
core