English
Related papers

Related papers: Lower Bounds for Tropical Circuits and Dynamic Pro…

200 papers

Circuit lower bounds are important since it is believed that a super-polynomial circuit lower bound for a problem in NP implies that P!=NP. Razborov has proved superpolynomial lower bounds for monotone circuits by using method of…

Computational Complexity · Computer Science 2020-06-29 Boyu Sima

We introduce tropical complexes, as an enrichment of the dual complex of a degeneration with additional data from non-transverse intersection numbers. We define cycles, divisors, and linear equivalence on tropical complexes, analogous both…

Algebraic Geometry · Mathematics 2019-09-13 Dustin Cartwright

Cyclic codes have many applications in consumer electronics, communication and data storage systems due to their efficient encoding and decoding algorithms. An efficient approach to constructing cyclic codes is the sequence approach. In…

Information Theory · Computer Science 2022-10-24 Sihem Mesnager , Minjia Shi , Hongwei Zhu

We give new bounds on the reliability function of a typewriter channel with 5 inputs and crossover probability $1/2$. The lower bound is more of theoretical than practical importance; it improves very marginally the expurgated bound,…

Information Theory · Computer Science 2016-07-19 Marco Dalai , Yury Polyanskiy

A persistent dynamical system in $\mathbb{R}^d_{> 0}$ is one whose solutions have positive lower bounds for large $t$, while a permanent dynamical system in $\mathbb{R}^d_{> 0}$ is one whose solutions have uniform upper and lower bounds for…

Dynamical Systems · Mathematics 2019-10-29 James D. Brunner , Gheorghe Craciun

The tropical convex hull of a finite set of points in tropical projective space has a natural structure of a cellular free resolution. Therefore, methods from computational commutative algebra can be used to compute tropical convex hulls.…

Metric Geometry · Mathematics 2012-02-13 Florian Block , Josephine Yu

Any monotone Boolean circuit computing the $n$-dimensional Boolean convolution requires at least $n^2$ and-gates. This precisely matches the obvious upper bound.

Computational Complexity · Computer Science 2020-01-22 Mike S. Paterson

Tropical geometry with the max-plus algebra has been applied to statistical learning models over tree spaces because geometry with the tropical metric over tree spaces has some nice properties such as convexity in terms of the tropical…

Combinatorics · Mathematics 2021-11-02 Ruriko Yoshida , Shelby Cox

We propose a definition of tropical linear series that isolates some of the essential combinatorial properties of tropicalizations of not-necessarily-complete linear series on algebraic curves. The definition combines the Baker-Norine…

Algebraic Geometry · Mathematics 2022-10-03 David Jensen , Sam Payne

A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, Mod6-SAT,…

Computational Complexity · Computer Science 2010-02-03 Ryan Williams

We discuss a novel analysis method for reaction network systems with polynomial or rational rate functions. This method is based on computing tropical equilibrations defined by the equality of at least two dominant monomials of opposite…

Molecular Networks · Quantitative Biology 2015-08-25 Satya Swarup Samal , Dima Grigoriev , Holger Fröhlich , Ovidiu Radulescu

Unlike many physical nonequilibrium systems, in biological systems, the coupling to external energy sources is not a fixed parameter but adaptively controlled by the system itself. We do not have theoretical frameworks that allow for such…

Populations and Evolution · Quantitative Biology 2025-06-30 Ankit Dhanuka , Avi I. Flamholz , Arvind Murugan , Akshit Goyal

The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-04-01 Fabian Kuhn , Thomas Moscibroda , Roger Wattenhofer

Due to their efficient encoding and decoding algorithms cyclic codes, a subclass of linear codes, have applications in consumer electronics, data storage systems, and communication systems. In this paper, Dickson polynomials of the first…

Information Theory · Computer Science 2016-11-18 Cunsheng Ding

Periodic classical trajectories are of fundamental importance both in classical and quantum physics. Here we develop path integral techniques to investigate such trajectories in an arbitrary, not necessarily energy conserving hamiltonian…

High Energy Physics - Theory · Physics 2016-09-06 Antti J. Niemi

This paper studies the performance of block coding on an additive white Gaussian noise channel under different power limitations at the transmitter. Lower bounds are presented for the minimum error probability of codes satisfying maximal…

Information Theory · Computer Science 2020-08-19 Gonzalo Vazquez-Vilar

Tropical algebra is an emerging field with a number of applications in various areas of mathematics. In many of these applications appeal to tropical polynomials allows to study properties of mathematical objects such as algebraic varieties…

Algebraic Geometry · Mathematics 2015-06-05 Dima Grigoriev , Vladimir V. Podolskii

Ambiguity in the contact between laboratory instruments and equations of quantum mechanics is formulated in terms of responses of the instruments to commands transmitted to them by a Classical digital Process-control Computer (CPC); in this…

Quantum Physics · Physics 2015-06-26 John M. Myers , F. Hadi Madjid

This article describes a numerical procedure designed to tune the parameters of periodically-driven dynamical systems to a state in which they exhibit rich dynamical behavior. This is achieved by maximizing the diversity of subharmonic…

Chaotic Dynamics · Physics 2017-02-13 Leandro M. Alonso

We present exponential and super factorial lower bounds on the number of Hamiltonian cycles passing through any edge of the basis graphs of a graphic, generalized Catalan and uniform matroids. All lower bounds were obtained by a common…