18 citations · 56 across the 13 of their papers we have counts for
19 papers
Alpern Lemma Independent of a Partition for Aperiodic Systems
Nishant Chandgotia, Zemer Kosloff, Shrey Sanadhya
We prove that for every , an aperiodic, probability preserving system and a finite measurable partition of , there exists an Alpern Multitower…
Finitely Dependent Processes on Subshifts
Nishant Chandgotia, Aditya Thorat
Finitely dependent processes generalize independent processes by requiring that the restrictions of the process to sufficiently separated sets are independent. The existence of sta…
On the cohomology of homshifts
Nishant Chandgotia, Silvère Gangloff, Benjamin Hellouin de Menibus +1
We study the cohomology of symbolic dynamical systems called homshifts: they are the nearest-neighbour shifts of finite type whose adjacency rules are the same in ev…
Undecidability of the block gluing classes of homshifts
Nishant Chandgotia, Silvère Gangloff, Benjamin Hellouin de Menibus +1
A homshift is a -dimensional shift of finite type which arises as the space of graph homomorphisms from the grid graph to a finite connected undirected graph .…
Shifts of Finite Type Obtained by Forbidding a Single Pattern
Nishant Chandgotia, Brian Marcus, Jacob Richey +1
Given a finite word , Guibas and Odlyzko (J. Combin. Theory Ser. A, 30, 1981, 183-208) showed that the autocorrelation polynomial of , which records the set of self-…
Open questions in descriptive set theory and dynamical systems
Jérôme Buzzi, Nishant Chandgotia, Matthew Foreman +6
This file is composed of questions that emerged or were of interest during the workshop "Interactions between Descriptive Set Theory and Smooth Dynamics" that took place in Banff,…
Large deviations for the 3D dimer model
Nishant Chandgotia, Scott Sheffield, Catherine Wolfram
In 2000, Cohn, Kenyon and Propp studied uniformly random perfect matchings of large induced subgraphs of (a.k.a. dimer configurations or domino tilings) and developed…
Borel factors and embeddings of systems in subshifts
Nishant Chandgotia, Spencer Unger
In this paper we study the combinatorics of free Borel actions of the group on Polish spaces. Building upon recent work by Chandgotia and Meyerovitch, we introduce pr…
Predictive Sets
Nishant Chandgotia, Benjamin Weiss
A set is called predictive if for any zero entropy finite-valued stationary process , is measurable with respect to $(X_i)_{i\in…
Mixing properties of colorings of the lattice
Noga Alon, Raimundo Briceño, Nishant Chandgotia +2
We study and classify proper -colorings of the lattice, identifying three regimes where different combinatorial behavior holds: (1) When , there exist fr…
Borel subsystems and ergodic universality for compact -systems via specification and beyond
Nishant Chandgotia, Tom Meyerovitch
A Borel system is `almost Borel universal' if any free Borel dynamical system of strictly lower entropy is isomorphic to a Borel subsystem of , after removin…
Delocalization of uniform graph homomorphisms from to
Nishant Chandgotia, Ron Peled, Scott Sheffield +1
Graph homomorphisms from the lattice to are functions on whose gradients equal one in absolute value. These functions are the height func…
Kirszbraun-type Theorems For Graphs
Nishant Chandgotia, Igor Pak, Martin Tassy
The classical Kirszbraun theorem says that all -Lipschitz functions , , with the Euclidean metric have a -Lipschitz ex…
Rational ergodicity of Step function Skew Products
Jon. Aaronson, Michael Bromberg, Nishant Chandgotia
We study rational step function skew products over certain rotations of the circle proving ergodicity and bounded rational ergodicity when rotation number is a quadratic irrational…
Mixing Properties for Hom-Shifts and the Distance between Walks on Associated Graphs
Nishant Chandgotia, Brian Marcus
Let be a finite connected undirected graph and be the graph of bi-infinite walks on ; two such walks and $\{…
Four-Cycle Free Graphs, Height Functions, the Pivot Property and Entropy Minimality
Nishant Chandgotia
Fix . Given a finite undirected graph without self-loops and multiple edges, consider the corresponding `vertex' shift, de…
Generalisation of the Hammersley-Clifford Theorem on Bipartite Graphs
Nishant Chandgotia
The Hammersley-Clifford theorem states that if the support of a Markov random field has a safe symbol then it is a Gibbs state with some nearest neighbour interaction. In this pape…
Markov Random Fields, Markov Cocycles and The 3-colored Chessboard
Nishant Chandgotia, Tom Meyerovitch
The well-known Hammersley-Clifford theorem states (under certain conditions) that any Markov random field is a Gibbs state for a nearest neighbor interaction. In this paper we stud…
One dimensional Markov random fields, Markov chains and Topological Markov fields
Nishant Chandgotia, Guangyue Han, Brian Marcus +2
In this paper we show that any one-dimensional stationary, finite-valued Markov Random Field (MRF) is a Markov chain, without any mixing condition or condition on the support. Our…