Results 91 to 100 of about 352 (164)

Optimal Designs for Discrete Choice Models Via Graph Laplacians. [PDF]

J Stat Theory Pract
Röttger F, Kahle T, Schwabe R.
europepmc   +1 more source

Causal Structure Learning: A Combinatorial Perspective. [PDF]

Found Comut Math, 2022
Squires C, Uhler C.
europepmc   +1 more source

Combinatorial descriptions of products in the category of forests and open order-preserving maps

, 2014
In [1], the authors introduce a technique to compute finite coproducts of finite Gödel algebras, i.e. Heyting algebras satisfying the prelinearity axiom $(\alpha \rightarrow \beta)\vee(\beta \rightarrow \alpha)$.
P. Codara, O.M. D'Antona, V. Marra
core  

On Graphs Embeddable in a Layer of a Hypercube and Their Extremal Numbers. [PDF]

Ann Comb
Axenovich M, Martin RR, Winter C.
europepmc   +1 more source

Combinatorics with definable sets: Euler characteristics and Grothendieck rings

, 2000
. We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure.
Jan Krajíček, Thomas Scanlon
core  

Innovation in viruses: fitness valley crossing, neutral landscapes, or just duplications? [PDF]

Virus Evol
Banse P, Elena SF, Beslon G.
europepmc   +1 more source

Log-concavity in Combinatorics

We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed volumes, Lorentzian ...
Yan, Alan
core  

D-Log and Formal Flow for Analytic Isomorphisms of N-Space

, 2003
Given a formal map of the form terms, we give tree expansion formulas and associated algorithms for the D-Log of and the formal flow . The coefficients that appear in these formulas can be viewed as certain generalizations of the Bernoulli numbers and ...
Wright, David, Zhao, Wenhua
core  

Fluctuation Moments for Regular Functions of Wigner Matrices. [PDF]

Math Phys Anal Geom
Reker J.
europepmc   +1 more source

Simplicity in relational structures and its application to permutation classes

, 2008
The simple relational structures form the units, or atoms, upon which all other relational structures are constructed by means of the substitution decomposition.
Brignall, Robert
core