中文
相关论文

相关论文: A combinatorial approach to exponential patterns i…

200 篇论文

This is an expository paper aiming to introduce Zilber's Exponential Closedness conjecture to a general audience. Exponential Closedness predicts when (systems of) equations involving addition, multiplication, and exponentiation have…

复变函数 · 数学 2024-10-21 Vahagn Aslanyan , Francesco Gallinaro

Let $\mathcal{R}$ be a commutative ring with unity, and let $P$ be a locally finite poset. The aim of the paper is to provide an explicit description of the additive biderivations of the incidence algebra $I(P, \mathcal{R})$. We demonstrate…

环与代数 · 数学 2024-12-25 Zhipeng Guan , Chi Zhang

N. Hindman and D. Strauss had shown that, for discrete semigroups, the cartesian product of two central sets are central. They also proved that the product of J- sets and C-sets are also J-set and C-set and characterized when the infnite…

组合数学 · 数学 2019-12-23 Sayan Goswami

Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, the…

代数几何 · 数学 2018-05-04 E. Artal , J. Carmona , J. I. Cogolludo , M. A. Marco

In "IP-sets and polynomial recurrence", Bergelson, Furstenberg, and McCutcheon established the following far reaching extension of Khintchine's recurrence theorem: For any invertible probability preserving system $(X,\mathcal A,\mu,T)$, any…

动力系统 · 数学 2024-01-10 Rigoberto Zelada

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

数据结构与算法 · 计算机科学 2024-10-29 Amir Abboud , Nick Fischer , Ron Safier , Nathan Wallheimer

We adapt methods coming from additive combinatorics in groups to the study of linear span in associative unital algebras. In particular, we establish for these algebras analogues of Diderrich-Kneser's and Hamidoune's theorems on sumsets and…

组合数学 · 数学 2015-06-24 Vincent Beck , Cédric Lecouvey

Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k length arithmetic progression and such collection is also piecewise syndetic in Z: They used algebraic structure of beta N. The above result…

组合数学 · 数学 2019-08-12 Pintu Debnath , Sayan Goswami

We introduce the notion of additive units and roots of a unit in a spatial product system. The set of all roots of any unit forms a Hilbert space and its dimension is the same as the index of the product system. We show that a unit and all…

泛函分析 · 数学 2015-02-02 B. V. Rajarama Bhat , Martin Lindsay , Mithun Mukherjee

We study the growth of product sets in some finite three-dimensional matrix groups. In particular, we prove two results about the group of $2\times 2$ upper triangular matrices over arbitrary finite fields: a product set estimate using…

组合数学 · 数学 2020-05-12 Brendan Murphy , James Wheeler

Using the algebraic structure of the Stone-Cech compactification of the integers, Furstenberg and Glasner proved that for arbitrary k, every piecewise syndetic set contains a piecewise syndetic set of k-term arithmetic progressions. We…

组合数学 · 数学 2008-09-11 Mathias Beiglboeck

Many fundamental NP-hard problems can be formulated as integer linear programs (ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the dimension of the program, and polynomial in the size of the ILP. That…

数据结构与算法 · 计算机科学 2017-11-10 Dušan Knop , Martin Koutecký , Matthias Mnich

We introduce the notion of additive units, or `addits', of a pointed Arveson system, and demonstrate their usefulness through several applications. By a pointed Arveson system we mean a spatial Arveson system with a fixed normalised…

算子代数 · 数学 2018-01-18 B. V. Rajarama Bhat , J. Martin Lindsay , Mithun Mukherjee

This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…

组合数学 · 数学 2016-10-03 Wenjie Fang

We show that the points that converge to infinity under iteration of the exponential map form a connected subset of the complex plane.

动力系统 · 数学 2010-04-08 Lasse Rempe

We prove a family of identities, expressing generating functions of powers of characteristic polynomials of permutations, as finite or infinite products. These generalize formulae first obtained in a study of the geometry/topology of…

组合数学 · 数学 2021-10-19 Carlos A. A. Florentino

We extend some methods of bounding exponential sums of the type $\displaystyle\sum_{n\le N}e^{2\pi iag^n/p}$ to deal with the case when $g$ is not necessarily a primitive root. We also show some recent results of Shkredov concerning…

数论 · 数学 2013-02-19 Bryce Kerr

In 2006, Budur, Musta\c{t}\v{a} and Saito introduced the notion of Bernstein-Sato polynomial of an arbitrary scheme of finite type over fields of characteristic zero. Because of the strong monodromy conjecture, it should have a…

数论 · 数学 2025-11-19 Kien Huu Nguyen

We develop in this paper general techniques to analyze local combinatorial structures in product sets of two subsets of a countable group which are "large" with respect to certain classes of (not necessarily invariant) means on the group.…

动力系统 · 数学 2016-02-22 MIchael Björklund , Alexander Fish

The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…

组合数学 · 数学 2021-11-17 Quinn Minnich