Results 11 to 20 of about 8,826,545 (192)
On Generating Functions of Generating Trees [PDF]
Generating trees are infinite trees that constitute a way to describe many classical combinatorial objects by encoding the choices leading to objects of a given size into paths in a tree of possibilities.
Gardy, Danièle +11 more
core +7 more sources
Separation algorithms for 0-1 knapsack polytopes [PDF]
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms for them, i.e., routines for detecting when they are violated.
Letchford, Adam, Kaparis, Konstantinos
core +4 more sources
Symbolic Analysis for Boundary Problems: From Rewriting to Parametrized Groebner Bases [PDF]
We review our algebraic framework for linear boundary problems (concentrating on ordinary differential equations). Its starting point is an appropriate algebraization of the domain of functions, which we have named integro-differential algebras.
Regensburger, Georg +4 more
core +1 more source
ON FINDING COEFFICIENT OF GENERATING FUNCTION [PDF]
This paper review the method of determining the coefficients of a generating function. Generating functions are a convenient tool for handling special constraints in selection and arrangement problems.
Chen, William W.S.
core +3 more sources
Exact enumeration of graphs and bipartite graphs with degree constraints [PDF]
We provide a new explicit formula enumerating graphs with constraints on their degrees, such as regular graphs, and extend it to bipartite graphs. It relies on generating function manipulations and Hadamard products.
Caizergues, Emma, de Panafieu, Elie
core
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source
Alternating sign matrix enumeration involving numbers of inversions and -1's, and positions of boundary 1's [PDF]
This paper consists of a review of results for the exact enumeration of alternating sign matrices of fixed size with prescribed values of some or all of the following six statistics: the numbers of generalized inversions and -1's, and the positions of ...
Behrend, Roger E.
core +4 more sources
How do genomes gain new functional parts? In eukaryotes, which tend to evolve under weak selection, much of the genome is junk. Palazzo and Qiu borrow the logic of Markov chains to show how non‐functional DNA becomes functional through the appearance of intermediate states, which arise due to epistasis, buffering, and biochemical messiness, allowing ...
Alexander F. Palazzo, Yi Qiu
wiley +1 more source
Artificial molecular machines and motors—Design and control of nanoscale motion
Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley +1 more source
Generating Functions for Asymmetric Random Walk Processes With Double Absorbing Barriers
Generating functions for asymmetric step-size paths restricted by two absorbing barriers are derived. The method begins by applying the Lagrange inversion formula to arbitrary powers of roots of the characteristic equation, that being a trinomial, which ...
Hakimoglu-Brown, Cetin
core

