scholarly journals SUMS OF POLYNOMIAL-TYPE EXCEPTIONAL UNITS MODULO

Author(s):  
JUNYONG ZHAO ◽  
SHAOFANG HONG ◽  
CHAOXI ZHU

Abstract Let $f(x)\in \mathbb {Z}[x]$ be a nonconstant polynomial. Let $n\ge 1, k\ge 2$ and c be integers. An integer a is called an f-exunit in the ring $\mathbb {Z}_n$ of residue classes modulo n if $\gcd (f(a),n)=1$ . We use the principle of cross-classification to derive an explicit formula for the number ${\mathcal N}_{k,f,c}(n)$ of solutions $(x_1,\ldots ,x_k)$ of the congruence $x_1+\cdots +x_k\equiv c\pmod n$ with all $x_i$ being f-exunits in the ring $\mathbb {Z}_n$ . This extends a recent result of Anand et al. [‘On a question of f-exunits in $\mathbb {Z}/{n\mathbb {Z}}$ ’, Arch. Math. (Basel)116 (2021), 403–409]. We derive a more explicit formula for ${\mathcal N}_{k,f,c}(n)$ when $f(x)$ is linear or quadratic.

2021 ◽  
Vol 6 (12) ◽  
pp. 13515-13524
Author(s):  
Junyong Zhao ◽  
◽  

<abstract><p>For any positive integer $ n $, let $ \mathbb Z_n: = \mathbb Z/n\mathbb Z = \{0, \ldots, n-1\} $ be the ring of residue classes module $ n $, and let $ \mathbb{Z}_n^{\times}: = \{x\in \mathbb Z_n|\gcd(x, n) = 1\} $. In 1926, for any fixed $ c\in\mathbb Z_n $, A. Brauer studied the linear congruence $ x_1+\cdots+x_m\equiv c\pmod n $ with $ x_1, \ldots, x_m\in\mathbb{Z}_n^{\times} $ and gave a formula of its number of incongruent solutions. Recently, Taki Eldin extended A. Brauer's result to the quadratic case. In this paper, for any positive integer $ n $, we give an explicit formula for the number of incongruent solutions of the following cubic congruence</p> <p><disp-formula> <label/> <tex-math id="FE1"> \begin{document}$ x_1^3+\cdots +x_m^3\equiv 0\pmod n\ \ \ {\rm with} \ x_1, \ldots, x_m \in \mathbb{Z}_n^{\times}. $\end{document} </tex-math></disp-formula></p> </abstract>


2009 ◽  
Vol 79 (3) ◽  
pp. 507-512 ◽  
Author(s):  
MICHAEL D. HIRSCHHORN ◽  
JAMES A. SELLERS

AbstractUsing elementary means, we derive an explicit formula for a3(n), the number of 3-core partitions of n, in terms of the prime factorization of 3n+1. Based on this result, we are able to prove several infinite families of arithmetic results involving a3(n), one of which specializes to the recent result of Baruah and Berndt which states that, for all n≥0, a3(4n+1)=a3(n).


2019 ◽  
Vol 150 (5) ◽  
pp. 2620-2631 ◽  
Author(s):  
Robert J. Martin ◽  
Jendrik Voss ◽  
Patrizio Neff ◽  
Ionel-Dumitrel Ghiba

AbstractIn this note, we provide an explicit formula for computing the quasiconvex envelope of any real-valued function W; SL(2) → ℝ with W(RF) = W(FR) = W(F) for all F ∈ SL(2) and all R ∈ SO(2), where SL(2) and SO(2) denote the special linear group and the special orthogonal group, respectively. In order to obtain our result, we combine earlier work by Dacorogna and Koshigoe on the relaxation of certain conformal planar energy functions with a recent result on the equivalence between polyconvexity and rank-one convexity for objective and isotropic energies in planar incompressible nonlinear elasticity.


Author(s):  
Judit Abardia-Evéquoz ◽  
Andreas Bernig

AbstractWe show the existence of additive kinematic formulas for general flag area measures, which generalizes a recent result by Wannerer. Building on previous work by the second named author, we introduce an algebraic framework to compute these formulas explicitly. This is carried out in detail in the case of the incomplete flag manifold consisting of all $$(p+1)$$ ( p + 1 ) -planes containing a unit vector.


2015 ◽  
Vol 93 (2) ◽  
pp. 186-193 ◽  
Author(s):  
MASANOBU KANEKO ◽  
MIKA SAKATA

We give three identities involving multiple zeta values of height one and of maximal height: an explicit formula for the height-one multiple zeta values, a regularised sum formula and a sum formula for the multiple zeta values of maximal height.


2021 ◽  
Vol 30 (2) ◽  
Author(s):  
Tom Gur ◽  
Yang P. Liu ◽  
Ron D. Rothblum

AbstractInteractive proofs of proximity allow a sublinear-time verifier to check that a given input is close to the language, using a small amount of communication with a powerful (but untrusted) prover. In this work, we consider two natural minimally interactive variants of such proofs systems, in which the prover only sends a single message, referred to as the proof. The first variant, known as -proofs of Proximity (), is fully non-interactive, meaning that the proof is a function of the input only. The second variant, known as -proofs of Proximity (), allows the proof to additionally depend on the verifier's (entire) random string. The complexity of both s and s is the total number of bits that the verifier observes—namely, the sum of the proof length and query complexity. Our main result is an exponential separation between the power of s and s. Specifically, we exhibit an explicit and natural property $$\Pi$$ Π that admits an with complexity $$O(\log n)$$ O ( log n ) , whereas any for $$\Pi$$ Π has complexity $$\tilde{\Omega}(n^{1/4})$$ Ω ~ ( n 1 / 4 ) , where n denotes the length of the input in bits. Our lower bound also yields an alternate proof, which is more general and arguably much simpler, for a recent result of Fischer et al. (ITCS, 2014). Also, Aaronson (Quantum Information & Computation 2012) has shown a $$\Omega(n^{1/6})$$ Ω ( n 1 / 6 ) lower bound for the same property $$\Pi$$ Π .Lastly, we also consider the notion of oblivious proofs of proximity, in which the verifier's queries are oblivious to the proof. In this setting, we show that s can only be quadratically stronger than s. As an application of this result, we show an exponential separation between the power of public and private coin for oblivious interactive proofs of proximity.


Sign in / Sign up

Export Citation Format

Share Document