Results 71 to 80 of about 2,704,358 (204)
New Families of Strength‐3 Covering Arrays Using Linear Feedback Shift Register Sequences
Journal of Combinatorial Designs, Volume 33, Issue 4, Page 156-171, April 2025.ABSTRACT In an array over an alphabet of v symbols, a t‐set of column indices { c 1 , … , c t } is covered if each t‐tuple of the alphabet occurs at least once as a row of the sub‐array indexed by c 1 , … , c t. A covering array, denoted by CA( N ; t , k , v ), is an N × k array over an alphabet with v symbols with the property that any t‐set of ...
Kianoosh Shokri, Lucia Moura
wiley +1 more source
Formalizing the transformations of a cognitive universe [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 In an effort to continue the pioneering work of Harary in USA and Flament in France, we have undertaken to develop, on an experimental basis, a formalized theory of systems of beliefs and their modifications.
N. Lafaye de Micheaux +3 more
doaj +1 more source
On the Pre‐ and Post‐Positional Semi‐Random Graph Processes
Journal of Graph Theory, Volume 108, Issue 4, Page 819-831, April 2025.ABSTRACT We study the semi‐random graph process, and a variant process recently suggested by Nick Wormald. We show that these two processes are asymptotically equally fast in constructing a semi‐random graph G $G$ that has property P ${\mathscr{P}}$, for the following examples of P ${\mathscr{P}}$: (1) P ${\mathscr{P}}$ is the set of graphs containing ...
Pu Gao, Hidde Koerts
wiley +1 more source
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
Combinatorial Optimization [PDF]
, 2018 Combinatorial Optimization is an active research area that developed from the rich interaction among many mathematical areas, including combinatorics, graph theory, geometry, optimization, probability, theoretical computer science, and many others.
core +2 more sources
On a Question of Erdős and Nešetřil About Minimal Cuts in a Graph
Journal of Graph Theory, Volume 108, Issue 4, Page 817-818, April 2025.ABSTRACT Answering a question of Erdős and Nešetřil, we show that the maximum number of inclusion‐wise minimal vertex cuts in a graph on n $n$ vertices is at most 1.889 9 n $1.889{9}^{n}$ for large enough n $n$.
Domagoj Bradač
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
Refuting conjectures in extremal combinatorics via linear programming [PDF]
arXiv, 2019 We apply simple linear programming methods and an LP solver to refute a number of open conjectures in extremal combinatorics.
arxiv
Agrárpiaci Jelentések Gabona és ipari növények [PDF]
, 2011 Source at https://journalofmathematicsandculture.wordpress.com/2017/12/28/journal-of-mathematics-and-culture-volume-11-number-4/.A group of Sámi middle school mathematics teachers cooperated with researchers over a period of three years in investigating
Børresen, Tove +7 more
core +1 more source
A new construction of forests with low visibility
Mathematika, Volume 71, Issue 2, April 2025.Abstract A set of points with finite density is constructed in Rd$\mathbb {R}^d$, with d⩾2$d\geqslant 2$, by adding points to a Poisson process such that any line segment of length Oε−(d−1)lnε−1$O\left(\varepsilon ^{-(d-1)}\ln \varepsilon ^{-1}\right)$ in Rd$\mathbb {R}^d$ will contain one of the points of the set within distance ε$\varepsilon$ of it ...
Kirill Kashkan
wiley +1 more source