574 research outputs found
On vanishing of Kronecker coefficients
We show that the problem of deciding positivity of Kronecker coefficients is
NP-hard. Previously, this problem was conjectured to be in P, just as for the
Littlewood-Richardson coefficients. Our result establishes in a formal way that
Kronecker coefficients are more difficult than Littlewood-Richardson
coefficients, unless P=NP.
We also show that there exists a #P-formula for a particular subclass of
Kronecker coefficients whose positivity is NP-hard to decide. This is an
evidence that, despite the hardness of the positivity problem, there may well
exist a positive combinatorial formula for the Kronecker coefficients. Finding
such a formula is a major open problem in representation theory and algebraic
combinatorics.
Finally, we consider the existence of the partition triples such that the Kronecker coefficient but the
Kronecker coefficient for some integer
. Such "holes" are of great interest as they witness the failure of the
saturation property for the Kronecker coefficients, which is still poorly
understood. Using insight from computational complexity theory, we turn our
hardness proof into a positive result: We show that not only do there exist
many such triples, but they can also be found efficiently. Specifically, we
show that, for any , there exists such that, for all
, there exist partition triples in the
Kronecker cone such that: (a) the Kronecker coefficient
is zero, (b) the height of is , (c) the height of is , and (d) . The proof of the last result
illustrates the effectiveness of the explicit proof strategy of GCT.Comment: 43 pages, 1 figur
Network Flow Algorithms for Discrete Tomography
Tomography is a powerful technique to obtain images of the interior of an object in a nondestructive way. First, a series of projection images (e.g., X-ray images) is acquired and subsequently a reconstruction of the interior is computed from the available project data. The algorithms that are used to compute such reconstructions are known as tomographic reconstruction algorithms. Discrete tomography is concerned with the tomographic reconstruction of images that are known to contain only a few different gray levels. By using this knowledge in the reconstruction algorithm it is often possible to reduce the number of projections required to compute an accurate reconstruction, compared to algorithms that do not use prior knowledge. This thesis deals with new reconstruction algorithms for discrete tomography. In particular, the first five chapters are about reconstruction algorithms based on network flow methods. These algorithms make use of an elegant correspondence between certain types of tomography problems and network flow problems from the field of Operations Research. Chapter 6 deals with a problem that occurs in the application of discrete tomography to the reconstruction of nanocrystals from projections obtained by electron microscopy.The research for this thesis has been financially supported by the Netherlands Organisation for Scientific Research (NWO), project 613.000.112.UBL - phd migration 201
Combinatorics and Geometry of Transportation Polytopes: An Update
A transportation polytope consists of all multidimensional arrays or tables
of non-negative real numbers that satisfy certain sum conditions on subsets of
the entries. They arise naturally in optimization and statistics, and also have
interest for discrete mathematics because permutation matrices, latin squares,
and magic squares appear naturally as lattice points of these polytopes.
In this paper we survey advances on the understanding of the combinatorics
and geometry of these polyhedra and include some recent unpublished results on
the diameter of graphs of these polytopes. In particular, this is a thirty-year
update on the status of a list of open questions last visited in the 1984 book
by Yemelichev, Kovalev and Kravtsov and the 1986 survey paper of Vlach.Comment: 35 pages, 13 figure
Donaldson-Thomas invariants, torus knots, and lattice paths
In this paper we find and explore the correspondence between quivers, torus
knots, and combinatorics of counting paths. Our first result pertains to quiver
representation theory -- we find explicit formulae for classical generating
functions and Donaldson-Thomas invariants of an arbitrary symmetric quiver. We
then focus on quivers corresponding to torus knots and show that their
classical generating functions, in the extremal limit and framing , are
generating functions of lattice paths under the line of the slope .
Generating functions of such paths satisfy extremal A-polynomial equations,
which immediately follows after representing them in terms of the Duchon
grammar. Moreover, these extremal A-polynomial equations encode
Donaldson-Thomas invariants, which provides an interesting example of
algebraicity of generating functions of these invariants. We also find a
quantum generalization of these statements, i.e. a relation between motivic
quiver generating functions, quantum extremal knot invariants, and -weighted
path counting. Finally, in the case of the unknot, we generalize this
correspondence to the full HOMFLY-PT invariants and counting of Schr\"oder
paths.Comment: 45 pages. Corrected typos in new versio
Provable Deterministic Sampling Strategies for Fourier Encoding in Magnetic Resonance Imaging
University of Minnesota M.S. thesis. August 2019. Major: Electrical/Computer Engineering. Advisor: Jarvis Haupt. 1 computer file (PDF); vii, 53 pages.There is a constant demand for acceleration of magnetic resonance (MR) imaging to alleviate motion artifacts, and more generally, due to the time sensitive nature of certain imaging applications. One way to speed up MR imaging is to reduce the image acquisition time by subsampling the data domain (k-space). There are several methods available to reconstruct the MR image from undersampled k-space, e.g., those based on the theory of Compressive Sensing. Standard methods employ random undersampling of k-space; however, these methods provide only probabilistic guarantees on the quality of reconstruction. We present a method to reconstruct MR images from deterministically undersampled k-space, and provide analytical guarantees on the quality of MR image reconstruction. Our approach uses sampling constructions formed by deterministic selection of rows of Fourier matrices; coupled with sparsity assumptions on the finite differences of MR images, we formulate the reconstruction problem as a Total Variation (TV) minimization problem. We demonstrate the utility of our TV minimization based approach for MR image reconstruction by reconstructing MR brain scan data, and compare our reconstructions with those obtained via random sampling. Our results suggest that accurate MR reconstructions are possible by deterministic undersampling the k-space, and the quality of deterministic reconstructions are on par with those of reconstructions from randomly acquired data
Manhattan Cutset Sampling and Sensor Networks.
Cutset sampling is a new approach to acquiring two-dimensional data, i.e., images, where values are recorded densely along straight lines. This type of sampling is motivated by physical scenarios where data must be taken along straight paths, such as a boat taking water samples. Additionally, it may be possible to better reconstruct image edges using the dense amount of data collected on lines. Finally, an advantage of cutset sampling is in the design of wireless sensor networks. If battery-powered sensors are placed densely along straight lines, then the transmission energy required for communication between sensors can be reduced, thereby extending the network lifetime.
A special case of cutset sampling is Manhattan sampling, where data is recorded along evenly-spaced rows and columns. This thesis examines Manhattan sampling in three contexts. First, we prove a sampling theorem demonstrating an image can be perfectly reconstructed from Manhattan samples when its spectrum is bandlimited to the union of two Nyquist regions corresponding to the two lattices forming the Manhattan grid. An efficient ``onion peeling'' reconstruction method is provided, and we show that the Landau bound is achieved. This theorem is generalized to dimensions higher than two, where again signals are reconstructable from a Manhattan set if they are bandlimited to a union of Nyquist regions. Second, for non-bandlimited images, we present several algorithms for reconstructing natural images from Manhattan samples. The Locally Orthogonal Orientation Penalization (LOOP) algorithm is the best of the proposed algorithms in both subjective quality and mean-squared error. The LOOP algorithm reconstructs images well in general, and outperforms competing algorithms for reconstruction from non-lattice samples. Finally, we study cutset networks, which are new placement topologies for wireless sensor networks. Assuming a power-law model for communication energy, we show that cutset networks offer reduced communication energy costs over lattice and random topologies. Additionally, when solving centralized and decentralized source localization problems, cutset networks offer reduced energy costs over other topologies for fixed sensor densities and localization accuracies. Finally, with the eventual goal of analyzing different cutset topologies, we analyze the energy per distance required for efficient long-distance communication in lattice networks.PhDElectrical Engineering: SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/120876/1/mprelee_1.pd
Convex Geometry and its Applications
The geometry of convex domains in Euclidean space plays a central role in several branches of mathematics: functional and harmonic analysis, the theory of PDE, linear programming and, increasingly, in the study of other algorithms in computer science. High-dimensional geometry, both the discrete and convex branches of it, has experienced a striking series of developments in the past 10 years. Several examples were presented at this meeting, for example the work of Rudelson et al. on conjunction matrices and their relation to confidential data analysis, that of Litvak et al. on remote sensing and a series of results by Nazarov and Ryabogin et al. on Mahler’s conjecture for the volume product of domains and their polars
Applications of network optimization
Includes bibliographical references (p. 41-48).Ravindra K. Ahuja ... [et al.]
- …