English
Related papers

Related papers: Polynomial shape adic systems are inherently expan…

200 papers

The independent set on a graph $G=(V,E)$ is a subset of $V$ such that no two vertices in the subset have an edge between them. The MIS problem on $G$ seeks to identify an independent set with maximum cardinality, i.e. maximum independent…

Data Structures and Algorithms · Computer Science 2017-05-26 Bhadrachalam Chitturi

The connection of orthogonal polynomials on the unit circle (OPUC) to the defocusing Ablowitz-Ladik integrable system involves the definition of a Poisson structure on the space of Verblunsky coefficients. In this paper, we compute the…

Classical Analysis and ODEs · Mathematics 2011-10-25 Irina Nenciu

We consider the category of partially observable dynamical systems, to which the entropy theory of dynamical systems extends functorially. This leads us to introduce quotient-topological entropy. We discuss the structure that emerges. We…

Dynamical Systems · Mathematics 2020-09-02 Leonhard Horstmeyer , Sharwin Rezagholi

Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.

Mathematical Physics · Physics 2007-05-23 M. Lorente

We show that programmable photonic circuit architectures composed of alternating mixing layers and active layers offer a high degree of flexibility. This alternating configuration enables the systematic tailoring of both the network's depth…

Optics · Physics 2025-12-30 Matthew Markowitz , Kevin Zelaya , Mohammad-Ali Miri

The Variational Autoencoder (VAE) is a powerful architecture capable of representation learning and generative modeling. When it comes to learning interpretable (disentangled) representations, VAE and its variants show unparalleled…

Machine Learning · Computer Science 2019-04-17 Michal Rolinek , Dominik Zietlow , Georg Martius

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

Numerical Analysis · Mathematics 2025-08-14 Elias Jarlebring , Gustaf Lorentzon

Bratteli--Vershik systems have been widely studied. In the context of general 0-dimensional systems, Bratteli--Vershik systems are homeomorphisms that have Kakutani--Rohlin refinements. Bratteli diagram has a strong power to analyze such…

Dynamical Systems · Mathematics 2015-06-23 Takashi Shimomura

We study the autonomous systems of quadratic differential equations of the form $\dot{x}_i(t)=\mathbf{x}(t)^T \mathbf{A}_i \mathbf{x}(t) + \mathbf{v}_i^T \mathbf{x}(t)$ with $\mathbf{x}(t) = (x_1(t),x_2(t),\dots,x_i(t),\dots)$ which, in…

Dynamical Systems · Mathematics 2023-11-22 Ádám Bácsi , Albert Tihamér Kocsis

A badly approximable system of affine forms is determined by a matrix and a vector. We show Kleinbock's conjecture for badly approximable systems of affine forms: for any fixed vector, the set of badly approximable systems of affine forms…

Dynamical Systems · Mathematics 2009-12-30 Manfred Einsiedler , Jimmy Tseng

Invariants of general linear system of two hyperbolic partial differential equations (PDEs) are derived under transformations of the dependent and independent variables by real infinitesimal method earlier. Here a subclass of the general…

Classical Analysis and ODEs · Mathematics 2015-08-14 A. Aslam , M. Safdar , F. M. Mahomed

For any family of measurable sets in a probability space, we show that either (i) the family has infinite Vapnik-Chervonenkis (VC) dimension or (ii) for every epsilon > 0 there is a finite partition pi such the pi-boundary of each set has…

Probability · Mathematics 2010-10-22 Terrence M. Adams , Andrew B. Nobel

Convolution is an integral operation that defines how the shape of one function is modified by another function. This powerful concept forms the basis of hierarchical feature learning in deep neural networks. Although performing convolution…

Computer Vision and Pattern Recognition · Computer Science 2019-12-04 Sameera Ramasinghe , Salman Khan , Nick Barnes , Stephen Gould

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Symbolic Computation · Computer Science 2013-10-16 Danko Adrovic , Jan Verschelde

Graph is a highly generic and diverse representation, suitable for almost any data processing problem. Spectral graph theory has been shown to provide powerful algorithms, backed by solid linear algebra theory. It thus can be extremely…

Computer Vision and Pattern Recognition · Computer Science 2023-04-20 Or Streicher , Ido Cohen , Guy Gilboa

We study the arithmetic circuit complexity of some well-known family of polynomials through the lens of parameterized complexity. Our main focus is on the construction of explicit algebraic branching programs (ABP) for determinant and…

Computational Complexity · Computer Science 2019-08-23 V. Arvind , Abhranil Chatterjee , Rajit Datta , Partha Mukhopadhyay

Affine systems reachability is the basis of many verification methods. With further computation, methods exist to reason about richer models with inputs, nonlinear differential equations, and hybrid dynamics. As such, the scalability of…

Numerical Analysis · Computer Science 2019-03-07 Stanley Bak , Hoang-Dung Tran , Taylor T. Johnson

Affine transformations in Euclidean space generates a correspondence between integrable systems on cotangent bundles to the sphere, ellipsoid and hyperboloid embedded in $R^n$. Using this correspondence and the suitable coupling constant…

Exactly Solvable and Integrable Systems · Physics 2022-11-17 A. V. Tsiganov

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…

Combinatorics · Mathematics 2015-03-17 R. Askanazi , S. Chmutov , C. Estill , J. Michel , P. Stollenwerk

We aim to completely formalize the rough topological analysis of integrable Hamiltonian systems admitting analytical solutions such that the initial phase variables along with the time derivatives of the auxiliary variables are expressed as…

Exactly Solvable and Integrable Systems · Physics 2013-09-30 Mikhail P. Kharlamov