Bifurcations in a predator-prey model with memory and diffusion II: Turing bifurcation

Research partially supported by the Hungarian National Foundation for Scientific Research, grant numbers 1186, 1994.     

Plant processing by simultaneous lactic acid fermentation and enzyme hydrolysis

Traditional ensiling of plant material by anaerobic lactic acid fermentation was combined with enzymatic hydrolysis (ENLAC for short) with cell wall degrading enzymes (hemicellulases, cellulases, and pectinases) to increase fiber digestibility or to increase the recovery of cell content from plants. Such findings were made using 0.015% (w/w, wet basis) Phylacell® enzyme preparation by ENLAC of corn and corn-sorghum mixtures, but not of forage grasses. Addition to alfalfa of a mixture of cell wall degrading enzymes, such as NOVO Viscozyme® together with NOVO Celluclast® each at 0.2–1.0% (w/w, wet basis), resulted in more rapid ensiling and improvement of rumen digestibility of silage by 20%. After 20 d of ensiling at 25 °C when the same enzymes were added to alfalfa at the 1.0% level, protein recovery by pressing increased by 35%, β-carotene recovery by 80%, and chlorophyll/xanthophyll recovery by 30%. ENLAC with the same enzymes also increased the recovery of sclareol from muscatel sage by 400%.

     

Limited resolution in complex network community detection with Potts model approach

According to Fortunato and Barthélemy, modularity-based community detection algorithms have a resolution threshold such that small communities in a large network are invisible. Here we generalize their work and show that the q-state Potts community detection method introduced by Reichardt and Bornholdt also has a resolution threshold. The model contains a parameter by which this threshold can be tuned, but no a priori principle is known to select the proper value. Single global optimization criteria do not seem capable for detecting all communities if their size distribution is broad.     

Fixed-Point-Free p-Elements in Transitive Permutation Groups

We give sufficient conditions for a finite permutation groupto contain a fixed-point-free permutation of p-power order fora given prime p.     

Coverings of Abelian groups and vector spaces

We study the question how many subgroups, cosets or subspaces are needed to cover a finite Abelian group or a vector space if we have some natural restrictions on the structure of the covering system. For example we determine, how many cosets we need, if we want to cover all but one element of an Abelian group. This result is a group theoretical extension of the theorem of Brouwer, Jamison and Schrijver about the blocking number of an affine space. We show that these covering problems are closely related to combinatorial problems, including the so-called additive basis conjecture, the three-flow conjecture, and a conjecture of Alon, Jaeger and Tarsi about nowhere zero vectors.     

Co-Orthogonal Codes

We define, construct and sketch possible applications of a new class of non-linear codes: co-orthogonal codes, with possible applications in cryptography and parallel processing. We also describe a fast and general method for generating (non-linear) codes with prescribed dot-products with the help of multi-linear polynomials.     

Lower bounds for transition probabilities on graphs

The paper presents two results. The first one provides separate conditions for the upper and lower estimates of the distribution of the time of exit from balls of a random walk on a weighted graph. The main result of the paper is that the lower estimate follows from the elliptic Harnack inequality. The second result is an off-diagonal lower bound for the transition probability of the random walk.