Results 71 to 80 of about 69,347 (192)
On the spectral dimension of random trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We determine the spectral dimensions of a variety of ensembles of infinite trees. Common to the ensembles considered is that sample trees have a distinguished infinite spine at whose vertices branches can be attached according to some probability ...
Bergfinnur Durhuus +2 more
doaj +1 more source
A Coding Theoretic Study on MLL proof nets
, 2010 Coding theory is very useful for real world applications. A notable example is digital television. Basically, coding theory is to study a way of detecting and/or correcting data that may be true or false. Moreover coding theory is an area of mathematics,
Girard +4 more
core +1 more source
New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique
Journal of Combinatorial Designs, Volume 34, Issue 1, Page 37-50, January 2026.ABSTRACT We provide some difference triangle sets with scopes that improve upon the best known values. These are found with purpose‐built digital circuits realized with field‐programmable gate arrays (FPGAs) rather than software algorithms running on general‐purpose processors.
Mohannad Shehadeh +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
On the Stability Barrier of Hermite Type Discretizations of Advection Equations
Numerical Methods for Partial Differential Equations, Volume 42, Issue 1, January 2026.ABSTRACT We establish a stability barrier for a class of high‐order Hermite‐type discretization of 1D advection equations underlying the hybrid‐variable (HV) and active flux (AF) methods. These methods approximate both cell averages and nodal solutions and evolve them in time simultaneously.
Xianyi Zeng
wiley +1 more source
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
Combinatorics in the Art of the Twentieth Century [PDF]
, 2017 This paper is motivated by a question I asked myself: How can combinatorial structures be used in a work of art? Immediately, other questions arose: Whether there are artists that work or think combinatorially?
Barrière Figueroa, Eulalia
core
On certain extremal Banach–Mazur distances and Ader's characterization of distance ellipsoids
Mathematika, Volume 72, Issue 1, January 2026.Abstract A classical consequence of the John Ellipsoid Theorem is the upper bound n$\sqrt {n}$ on the Banach–Mazur distance between the Euclidean ball and any symmetric convex body in Rn$\mathbb {R}^n$. Equality is attained for the parallelotope and the cross‐polytope. While it is known that they are unique with this property for n=2$n=2$ but not for n⩾
Florian Grundbacher, Tomasz Kobos
wiley +1 more source
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
Combinatorics on number walls and the P(t)$P(t)$‐adic Littlewood conjecture
Mathematika, Volume 72, Issue 1, January 2026.Abstract In 2004, de Mathan and Teulié stated the p$p$‐adic Littlewood conjecture (p$p$‐LC) in analogy with the classical Littlewood conjecture. Let Fq$\mathbb {F}_q$ be a finite field P(t)$P(t)$ be an irreducible polynomial with coefficients in Fq$\mathbb {F}_q$. This paper deals with the analogue of p$p$‐LC over the ring of formal Laurent series over
Steven Robertson
wiley +1 more source