Results 91 to 100 of about 69,062 (214)
A fixed point theorem for Boolean networks expressed in terms of forbidden subnetworks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We are interested in fixed points in Boolean networks, $\textit{i.e.}$ functions $f$ from $\{0,1\}^n$ to itself. We define the subnetworks of $f$ as the restrictions of $f$ to the hypercubes contained in $\{0,1\}^n$, and we exhibit a class $\mathcal{F ...
Adrien Richard
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
A note on the magnetic Steklov operator on functions
Mathematika, Volume 71, Issue 4, October 2025.Abstract We consider the magnetic Steklov eigenvalue problem on compact Riemannian manifolds with boundary for generic magnetic potentials and establish various results concerning the spectrum. We provide equivalent characterizations of magnetic Steklov operators which are unitarily equivalent to the classical Steklov operator and study bounds for the ...
Tirumala Chakradhar +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
Strong External Difference Families and Classification of α‐Valuations
Journal of Combinatorial Designs, Volume 33, Issue 9, Page 343-356, September 2025.ABSTRACT One method of constructing ( a 2 + 1 , 2 , a , 1 )‐SEDFs (i.e., strong external difference families) in Z a 2 + 1 makes use of α‐valuations of complete bipartite graphs K a , a. We explore this approach and we provide a classification theorem which shows that all such α‐valuations can be constructed recursively via a sequence of “blow‐up ...
Donald L. Kreher +2 more
wiley +1 more source
Decomposition spaces in combinatorics [PDF]
, 2016 A decomposition space (also called unital 2-Segal space) is a simplicial object satisfying an exactness condition weaker than the Segal condition: just as the Segal condition expresses (up to homotopy) composition, the new condition expresses ...
Gálvez Carrillo, Maria Immaculada +2 more
core +1 more source
Enumeration and Construction of Row‐Column Designs
Journal of Combinatorial Designs, Volume 33, Issue 9, Page 357-372, September 2025.ABSTRACT We computationally completely enumerate a number of types of row‐column designs up to isotopism, including double, sesqui, and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO‐arrays. We calculate autotopism group sizes for the designs we generate.
Gerold Jäger +3 more
wiley +1 more source
Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems
Journal of Graph Theory, Volume 110, Issue 1, Page 59-71, September 2025.ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh +2 more
wiley +1 more source
Network Evolution With Mesoscopic Delays
Random Structures &Algorithms, Volume 67, Issue 2, September 2025.ABSTRACT Owing to the influence of real‐world networks both in science and society, numerous mathematical models have been developed to understand the structure and evolution of these systems, particularly in a temporal context. Recent advancements in fields like distributed cyber‐security and social networks have spurred the creation of probabilistic ...
Sayan Banerjee +3 more
wiley +1 more source
A characterization of b-chromatic and partial Grundy numbers by induced subgraphs
, 2016 Gy{\'a}rf{\'a}s et al. and Zaker have proven that the Grundy number of a graph $G$ satisfies $\Gamma(G)\ge t$ if and only if $G$ contains an induced subgraph called a $t$-atom.The family of $t$-atoms has bounded order and contains a finite number of ...
Effantin, Brice +2 more
core +4 more sources