Optimization over Young diagrams

Journal of Algebraic Combinatorics - We consider the problem of finding a Young diagram minimizing the sum of evaluations of a given pair of functions on the parts of the associated pair of...     

Thermal Effects and Structural Changes of Photosynthetic Reaction Centers Characterized by Wide Frequency Band Hydrophone: Effects of Carotenoids and Terbutryn

Photothermal characteristics and light‐induced structural (volume) changes of carotenoid‐containing and noncontaining photosynthetic reaction centers (RCs) were investigated by wide frequency band hydrophone. We found that the presence of carotenoid either does not play considerable role in the light‐induced conformational movements, or these rearrangements are too slow for inducing a photoacoustic (PA) signal. The kinetic component with a few tens of microseconds, exhibited by the carotenoid‐less RCs, appears to be similar to that of triplet state lifetimes, identified by other methods. The binding of terbutryn to the acceptor side is shown to affect the dynamics of the RC. Our results do not confirm large displacements or volume changes induced by the charge movements and by the charge relaxation processes in the RCs in few hundreds of microseconds time scale that accompanies the electron transfer between the primary and secondary electron acceptor quinones.     

On the vanishing of homology in random Čech complexes

We compute the homology of random ?ech complexes over a homogeneous Poisson process on the d‐dimensional torus, and show that there are, coarsely, two phase transitions. The first transition is analogous to the Erd?s ‐Rényi phase transition, where the ?ech complex becomes connected. The second transition is where all the other homology groups are computed correctly (almost simultaneously). Our calculations also suggest a finer measurement of scales, where there is a further refinement to this picture and separation between different homology groups. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 14–51, 2017     

Improved Alignment-Based Algorithm for Multilingual Text Compression

Multilingual text compression exploits the existence of the same text in several languages to compress the second and subsequent copies by reference to the first. This is done based on bilingual text alignment, a mapping of words and phrases in one text to their semantic equivalents in the translation. A new multilingual text compression scheme is suggested, which improves over an immediate generalization of bilingual algorithms. The idea is to store the necessary markup data within the source language text; the incurred compression loss due to this overhead is smaller than the savings in the compressed target language texts, for a large enough number of the latter. Experimental results are presented for a parallel corpus in six languages extracted from the EUR-Lex website of the European Union. These results show the superiority of the new algorithm as a function of the number of languages.     

Modular Symbols and the Topological Nonrigidity of Arithmetic Manifolds

In this paper we address the existence of smooth manifolds proper homotopy equivalent to nonuniform arithmetic manifolds M = Γ\G/K that are not homeomorphic to it. While the manifolds M are properly rigid if rank_ℚ(Γ) ≤ 2, we show that the so‐called virtual structure group has infinite rank as a ℚ‐vector space if rank_ℚ(Γ) ≥ 4.© 2015 Wiley Periodicals, Inc.     

A polynomial oracle-time algorithm for convex integer minimization

In this paper we consider the solution of certain convex integer minimization problems via greedy augmentation procedures. We show that a greedy augmentation procedure that employs only directions from certain Graver bases needs only polynomially many augmentation steps to solve the given problem. We extend these results to convex N-fold integer minimization problems and to convex 2-stage stochastic integer minimization problems. Finally, we present some applications of convex N-fold integer minimization problems for which our approach provides polynomial time solution algorithms.     

N-fold integer programming and nonlinear multi-transshipment

The multi-transshipment problem is NP-hard already for two commodities over bipartite networks. Nonetheless, using our recent theory of n-fold integer programming and extensions developed herein, we are able to establish the polynomial time solvability of the problem in two broad situations. First, for any fixed number of commodities and number of suppliers, we solve the problem over bipartite networks with variable number of consumers in polynomial time. This is very natural in operations research applications where few facilities serve many customers. Second, for every fixed network, we solve the problem with variable number of commodities in polynomial time.