English
Related papers

Related papers: Factorizable embeddings and the period of an irred…

200 papers

We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…

Commutative Algebra · Mathematics 2026-03-25 Claire de Korte , Teresa Yu

Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. The known upper bound on the time…

Logic in Computer Science · Computer Science 2017-04-10 Marco Voigt

We study multidimensional minimal and quasiperiodic shifts of finite type. We prove for these classes several results that were previously known for the shifts of finite type in general, without restriction. We show that some quasiperiodic…

Discrete Mathematics · Computer Science 2021-07-01 Bruno Durand , Andrei Romashchenko

Let $\Bbb F_q$ be a finite field with $q$ elements. Let $n$ be a positive integer with radical $rad(n)$, namely, the product of distinct prime divisors of $n$. If the order of $q$ modulo $rad(n)$ is either 1 or a prime, then the irreducible…

Information Theory · Computer Science 2020-12-16 Yansheng Wu , Qin Yue

Using a modified Cahn-Hilliard-Cook theory for spinodal decomposition in a binary mixture that exhibits both diffusion and interconversion dynamics, we derive the time-dependent structure factor for concentration fluctuations. We compare…

We study the notion of irreducibility of semigroup morphisms. Given an alphabet $\Sigma$, a morphism $\varphi:\Sigma^+\rightarrow\Sigma^+$ is irreducible if any factorisation $\varphi=\psi_2\circ\psi_1$ can only be satisfied if $\psi_1$ or…

Formal Languages and Automata Theory · Computer Science 2026-03-17 Paul C. Bell , Eva Foster , Daniel Reidenbach

Polynomial factoring has famous practical algorithms over fields-- finite, rational \& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \bmod…

Computational Complexity · Computer Science 2019-02-27 Ashish Dwivedi , Rajat Mittal , Nitin Saxena

It is well-known that any $\mathbb{Z}$ subshift with the specification property has the property that every factor is intrinsically ergodic, i.e., every factor has a unique factor of maximal entropy. In recent work, other $\mathbb{Z}$…

Dynamical Systems · Mathematics 2015-10-14 Kevin McGoff , Ronnie Pavlov

We define the finite extension property for $d$-dimensional subshifts, which generalizes the topological strong spatial mixing condition defined by Brice\~no (2016), and we prove that this property is invariant under topological conjugacy.…

Dynamical Systems · Mathematics 2018-06-15 Raimundo Briceño , Kevin McGoff , Ronnie Pavlov

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

We give new criteria for the irreducibility of parabolic induction on the general linear group and its inner forms over a local non-archimedean field. In particular, we give a necessary and sufficient condition when the inducing data is of…

Number Theory · Mathematics 2017-01-12 Erez Lapid , Alberto Mínguez

The Special Affine Fourier Transformation(SAFT), which generalizes several well-known unitary transformations, has been demonstrated as a valuable tool in signal processing and optics. In this paper, we explore the multivariate dynamical…

Functional Analysis · Mathematics 2024-09-16 Meng Ning , Li-Ping Wu , Qing-yue Zhang , Bei Liu

In this work we consider an ensemble of random $\mathbb{Z}^d$-shifts of finite type ($\mathbb{Z}^d$-SFTs) and prove several results concerning the behavior of typical systems with respect to emptiness, entropy, and periodic points. These…

Dynamical Systems · Mathematics 2014-08-19 Kevin McGoff , Ronnie Pavlov

We look at constructions of aperiodic SFTs on fundamental groups of graph of groups. In particular we prove that all generalized Baumslag-Solitar groups (GBS) admit a strongly aperiodic SFT. Our proof is based on a structural theorem by…

Discrete Mathematics · Computer Science 2022-09-13 Nathalie Aubrun , Nicolás Bitar , Sacha Huriot-Tattegrain

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena

A first step towards more reliable software is to execute each statement and each control-flow path in a method once. In this paper, we present a formal method to automatically compute test cases for this purpose based on the idea of a…

Programming Languages · Computer Science 2012-05-31 Jürgen Christ , Jochen Hoenicke , Martin Schäf

We reanalyze the factorization theorems for Drell-Yan process and for deep inelastic scattering near threshold, as constructed in the framework of the soft-collinear effective theory (SCET), from a new, consistent perspective. In order to…

High Energy Physics - Phenomenology · Physics 2018-05-30 Junegone Chay , Chul Kim

We suggest two versions of the Hardy--Littlewood--Sobolev inequality for discrete time martingales. In one version, the fractional integration operator is a martingale transform, however, it may vanish if the filtration is excessively…

Probability · Mathematics 2020-09-14 Dmitriy Stolyarov , Dmitry Yarcev

The quantum phase transition point between the insulator and the superfluid phase at unit filling factor of the infinite one-dimensional Bose-Hubbard model is numerically computed with a high accuracy, better than current state of the art…

Statistical Mechanics · Physics 2009-11-13 Jakub Zakrzewski , Dominique Delande

We build an effective field theory (EFT) for quasicrystals -- aperiodic incommensurate lattice structures -- at finite temperature, entirely based on symmetry arguments and a well-define action principle. By means of Schwinger-Keldysh…

High Energy Physics - Theory · Physics 2020-11-04 Matteo Baggioli , Michael Landry