Results 81 to 90 of about 2,704,358 (204)
Label-based parameters in increasing trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Grown simple families of increasing trees are a subclass of increasing trees, which can be constructed by an insertion process. Three such tree families contained in the grown simple families of increasing trees are of particular interest: $\textit ...
Markus Kuba, Alois Panholzer
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
Generalisation : graphs and colourings [PDF]
, 2020 The interaction between practice and theory in mathematics is a central theme. Many mathematical structures and theories result from the formalisation of a real problem. Graph Theory is rich with such examples.
Zarb, Christina
core
An exotic calculus of Berezin–Toeplitz operators
Mathematika, Volume 71, Issue 2, April 2025.Abstract We develop a calculus of Berezin–Toeplitz operators quantizing exotic classes of smooth functions on compact Kähler manifolds and acting on holomorphic sections of powers of positive line bundles. These functions (classical observables) are exotic in the sense that their derivatives are allowed to grow in ways controlled by local geometry and ...
Izak Oltman
wiley +1 more source
Conditioned Galton-Watson trees do not grow [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 An example is given which shows that, in general, conditioned Galton-Watson trees cannot be obtained by adding vertices one by one, while this can be done in some important but special cases, as shown by Luczak and Winkler.
Svante Janson
doaj +1 more source
Extensions of Steiner Triple Systems
Journal of Combinatorial Designs, Volume 33, Issue 3, Page 94-108, March 2025.ABSTRACT In this article, we study extensions of Steiner triple systems by means of the associated Steiner loops. We recognize that the set of Veblen points of a Steiner triple system corresponds to the center of the Steiner loop. We investigate extensions of Steiner loops, focusing in particular on the case of Schreier extensions, which provide a ...
Giovanni Falcone +2 more
wiley +1 more source
Enumeration and Random Generation of Concurrent Computations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 In this paper, we study the shuffle operator on concurrent processes (represented as trees) using analytic combinatorics tools. As a first result, we show that the mean width of shuffle trees is exponentially smaller than the worst case upper-bound.
Olivier Bodini +2 more
doaj +1 more source
Combinatorics and Geometry of Transportation Polytopes: An Update [PDF]
, 2013 A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries.
De Loera, Jesús A., Kim, Edward D.
core
On Quasi‐Hermitian Varieties in Even Characteristic and Related Orthogonal Arrays
Journal of Combinatorial Designs, Volume 33, Issue 3, Page 109-122, March 2025.ABSTRACT In this article, we study the BM quasi‐Hermitian varieties, laying in the three‐dimensional Desarguesian projective space of even order. After a brief investigation of their combinatorial properties, we first show that all of these varieties are projectively equivalent, exhibiting a behavior which is strikingly different from what happens in ...
Angela Aguglia +3 more
wiley +1 more source
Statistical Properties of Similarity Score Functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 In computational biology, a large amount of problems, such as pattern discovery, deals with the comparison of several sequences (of nucleotides, proteins or genes for instance).
Jérémie Bourdon, Alban Mancheron
doaj +1 more source